class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) 
    {
        sort(nums.begin(),nums.end());
        int n = nums.size();
        int i=0,j=n-1;
        while(i<j)
        {
            if(nums[i] + nums[j] == target)
            {
               twoSum[0] = i;
                twoSum[1] = j;
                break;
            }
            else if(nums[i] + nums[j] < target)
            {
                i++;
            }

            else if(nums[i] + nums[j] > target)
            {
                j--;
            }
        }
    }
};