HDU 5777 domino

贪心一下。有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-;

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 = ;

    while(isdigit(c)) { x = x *  + c - ''; c = getchar(); }

    return x;

}

const int maxn=+;

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=;

        for(int i=;i<=n-;i++) scanf("%lld",&a[i]);

        if(k>=n) { printf("%d\n",n); continue; }

        sort(a+,a+n);

        for(int i=;i<=n-k;i++) ans=ans+a[i]; ans=ans+n;

        printf("%lld\n",ans);

    }

    return ;

}

相关文章