[Python]Fast and Easy solution.(Runtime:87.5%,Memory:87.5%)
**Solution\n\n\tclass Solution:\n\t\tdef kSum(self, nums: List[int], k: int) -> int:\n\t\t\tle = len(nums)\n\n\t\t\tnums = [0] + sorted(nums,key = abs)\n\n\t\t\
**Solution\n\n\tclass Solution:\n\t\tdef kSum(self, nums: List[int], k: int) -> int:\n\t\t\tle = len(nums)\n\n\t\t\tnums = [0] + sorted(nums,key = abs)\n\n\t\t\theap = [(-sum(num for num in nums if num > 0), 0)]\n\t\t\tfor _ in range(k):\n\t\t\t\ttmp = heappop(heap)\n\t\t\t\ti_sum = -tmp[0]\n\t\t\t\tpos = tmp[1]\n\n\t\t\t\tif pos < le:\n\t\t\t\t\t# remove next\n\t\t\t\t\tval = i_sum - abs(nums[pos + 1])\n\t\t\t\t\theappush(heap, (-val, pos + 1))\n\t\t\t\t\tif pos:\n\t\t\t\t\t\tval = i_sum + abs(nums[pos]) - abs(nums[pos + 1])\n\t\t\t\t\t\theappush(heap, (-val, pos + 1))\n\n\t\t\treturn i_sum\n
['Python']