class Solution {
public:
vector<int> findNumbersWithSum(vector<int>& nums, int target) {
sort (nums.begin() , nums.end()) ;
int left = 0 , right = nums.size() - 1 ;
vector<int>res ;
while ( left < right){
if ( nums[left] + nums[right] == target){
res.push_back (nums[left]) ;
res.push_back (nums[right]);
break ;
}else if ( nums[left] + nums[right] > target){
right-- ;
}else {
left++ ;
}
}
return res ;
}
};