1913. Maximum Product Difference Between Two Pairs

class Solution {
public:
    int maxProductDifference(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int sum = 0;
        int n = nums.size();
        int x = nums[0]*nums[1];
        int y = nums[n-1]*nums[n-2];
        sum = y-x;
        return sum;
    }
};