Geeksforgeeks Solution For " Mega Sale "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Mega Sale

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
 {
    int t, n, m;
    cin>>t;
    while(t--){
        cin>>n>>m;
        vector<int> vec(n);
        for(int i=0; i<n; i++)
            cin>>vec[i];
        sort(vec.begin(), vec.end());
        int ans=0;
        for(int i=0; i<n; i++){
            if(vec[i]<0 && i<m)
                ans+=vec[i];
            else    break;
        }
        cout<<abs(ans)<<endl;
    }
    return 0;
}

Output:-