class Solution {public://int compare(const void * arg1, const void *arg2)//{//return (*(int*)arg1 - *(int*)arg2);//}vector
     
       twoSum(vector
      
       & nums, int target) {        vector
       
         res;        vector
        
          temp=nums;        int left;        int right;                sort(nums.begin(),nums.end(),less
         
          ());        //qsort(nums.begin(), nums.size(), sizeof(int), compare);        left=0;right=nums.size()-1;        while(left!=right)        {        	if(nums[left]+nums[right]==target)			{                bool l=0,r=0;				for(int i=0;i
          
           =0;i--) { if(temp[i]==nums[right]) { res.push_back(i); break; } } break; } else if(nums[left]+nums[right]>target) { right--; } else { left++; } } return res;}};