HDU5777 domino (BestCoder Round #85 B) 思路题+排序

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef  long long LL;
const int N = 1e5+10;
int a[N];
int main(){
  int T,n,k;
  scanf("%d",&T);
  while(T--){
    scanf("%d%d",&n,&k);
    for(int i=1;i<n;++i)
      scanf("%d",&a[i]);
    LL ret=0;
    if(n<=k)ret+=n;
    else{
      sort(a+1,a+n);
      for(int i=1;i<=n-k;++i)ret+=a[i]+1;
      ret+=k;
    }
    printf("%I64d\n",ret);
  }
  return 0;
}