c++ 4 lines sort
\tint largestSumAfterKNegations(vector& A, int K) {        \n        for(int i=0;i<K;i++){\n            sort(A.begin(),A.end());\n            A[0]*=-1;\n       
\tint largestSumAfterKNegations(vector<int>& A, int K) {        \n        for(int i=0;i<K;i++){\n            sort(A.begin(),A.end());\n            A[0]*=-1;\n        }\n        return accumulate(A.begin(),A.end(),0);\n    }
[]