int threeSumClosest(vector<int>& nums, int target) {

     int sum=nums[]+nums[]+nums[];

     sort(nums.begin(), nums.end());

     for(int i=; i<nums.size()-; i++)

     {

         int p=i+, q=nums.size()-;

         while( p!=q )

         {

             int tmp=target-(nums[i]+nums[p]+nums[q]);

             if(abs(tmp)<abs(sum-target) )    sum=nums[i]+nums[p]+nums[q];

             if(!tmp)    return target;

             if(tmp>)    p++;

             else        q--;

         }

     }

     return sum;

 }