Given an array of integers, maximize sub of subsequence such that the sum of any two elements in the subsequence is greater than or equal to any other element.

Given a list of integers, find all pairs with given sum.

Solve the problem using binary search and math