Minimum difference of sums
I'm unable to add comments but I think this problem can be simplified to:

B = []
for pair in A:
    B.append(pair[0] - pair[1])

min_sum(B, k)


min_sum returns k elements that add up to give the smallest number possible (absolute value). This (at least to me) feels easier to work with.