C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 2e5+10;
LL p[N];
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++) scanf("%d", &p[i]);
sort(p,p+n,greater<int>());
LL res=0;
for(int i=0;i<m+1;m++)
{
res+=p[i];
}
cout<<res<<endl;
}
return 0;
}