GFG PTOD | 06 Jan 2025 | Sum Pair closest to target

vector<int> sumClosest(vector<int>& arr, int target) {
        // code here
        sort(arr.begin(), arr.end());
        int diff = INT_MAX, i=0, j=arr.size()-1;
        vector<int> res;
        while(i<j) {
            int sum = arr[i] + arr[j];
            if(abs(sum-target) < diff) {
                diff = abs(sum-target);
                res={arr[i], arr[j]};
            }
            if(sum < target) i++;
            else j--;
        }
        return res;
    }