Function main

Codeforces_problems/Barrels/soultion.cpp:11–27

using namespace std;

int main()
{
    int t; //define the variable that gonna hold the number of test cases
    cin>>t; //take input
    while(t--){
        int n,k;  //define n and k numbers that we gonna work with
        long long int sum=0;  //the maximum sum we gonna get *notation*:we define it as Long long because it will overflow int
        cin>>n>>k;  //take inputs
        vector <int> v(n);  //define vector of numbers of size n
        for(int i=0;i<n;i++)    cin>>v[i];  //taking input
        sort(v.rbegin(),v.rend());  //sortthe vector in descending order
        sum=v[0];
        for(int i=1;i<=k;i++)    sum+=v[i]; //calculating the maximum difference we could reach to
        cout<<sum<<endl;
    }
    return 0;
}
//Happy Coding :))