HDU 5777/BC 85B domino

来源：互联网发布：java的标识符编辑：程序博客网时间：2024/05/16 06:07

题解：模拟一下不难发现原问题可转换为去掉k-1个数其他数求和最后再加上n 也就是贪心的去掉前k-1大的即可

注意：k可能大于n

#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<vector>#include<list>#include<set>#include<map>#include<stack>#include<queue>#include<deque>#define mem(x,y) memset(x,y,sizeof(x))#define pb push_backusing namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<int,int> pii;#define bug puts("===========");#define zjc puts("");const double pi=(acos(-1.0));const double eps=1e-8;const ll INF=1e18+10;const ll inf=1e9+10;const int mod=1e9+7;const int maxn=1e5+10;const int maxm=1e6+5;int a[maxn];int main(){    int T_T;    scanf("%d",&T_T);    while(T_T--){        int n,k;        scanf("%d%d",&n,&k);        for(int i=1;i<n;i++) {            scanf("%d",&a[i]);        }        ll ans=n;        sort(a+1,a+n);        for(int i=1;i<n-k+1;i++)            ans+=a[i];        printf("%I64d\n",ans);    }    return 0;}

0 0