easy short efficient clean code
\nclass Solution {\n    typedef long long ll;\n    typedef pair<ll, ll> pi;\npublic:\n    long long kSum(vector<int>& v, int k) {\n        ll sz = v.size(), ans
```\nclass Solution {\n    typedef long long ll;\n    typedef pair<ll, ll> pi;\npublic:\n    long long kSum(vector<int>& v, int k) {\n        ll sz = v.size(), ans = 0;\n        for (auto& it : v) {\n            if (it > -1) {\n                ans += it;\n            }\n            it = abs(it);\n        }\n        sort(v.begin(), v.end());\n        priority_queue<pi>pq;\n        pq.push({ ans - v[0],0 });\n        while (--k) {\n            pi p = pq.top();\n            pq.pop();\n            ans = p.first;\n            if (p.second < sz - 1) {\n                pq.push({ p.first - v[p.second + 1],p.second + 1 });\n                pq.push({ p.first - v[p.second + 1] + v[p.second],p.second + 1 });\n            }\n        }\n        return ans;\n    }\n};\n```
['C', 'Sorting', 'Heap (Priority Queue)']