貪心一下。有k次機會，也就是那些數字中，最大的k-1可以不選擇。答案為：sum{a[i]}-sum{最大的k-1個a[i]}+n。注意：k>=n的時候直接輸出n。
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<iostream> using namespace std; typedef long long LL; const double pi=acos(-1.0),eps=1e-8; void File() {freopen("D:\\in.txt","r",stdin);freopen("D:\\out.txt","w",stdout); } inline int read() {char c = getchar(); while(!isdigit(c)) c = getchar();int x = 0;while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }return x; }const int maxn=100000+10; int T,n,k; LL a[maxn],ans; struct X{int p; LL val;}s[maxn]; bool cmp(X a,X b){ return a.val>b.val; }int main() {scanf("%d",&T);while(T--){scanf("%d%d",&n,&k); ans=0;for(int i=1;i<=n-1;i++) scanf("%lld",&a[i]);if(k>=n) { printf("%d\n",n); continue; }sort(a+1,a+n);for(int i=1;i<=n-k;i++) ans=ans+a[i]; ans=ans+n;printf("%lld\n",ans);}return 0; }
?
