题意: 现有n个无限大的杯子,第i个杯子中有a[i]升水。你有k次操作,每次能将一个杯子里的水倒入另一个杯子,试问k次操作结束后,含水量最大与最小之间的差值max为多少/
思路: 水题嘛,意思搞那么复杂,不就是求前k大数的和咩。
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, k, a[N];
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n >> k;
for(int i = 0; i < n; i ++) cin >> a[i];
sort(a, a+n);
int ans = 0;
for(int i = n-1; i >= n-k-1 && ~i; i --) ans += a[i];
cout << ans << endl;
}
return 0;
}