Fennec vs Monster

C - Fennec vs Monster

1. 链接

   C - Fennec vs Monster

2. 题意

   消去k个最大值后，输出剩下的数组和。

3. 代码实现

   #include<bits/stdc++.h> 
   using namespace std;
   typedef long long ll;
   const int maxn = 1e6+10;
   int a[maxn];
   bool cmp(int a,int b){
    return a > b;
   }
   int main(void){
    int n,k;
    cin >> n >> k;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    sort(a,a+n,cmp);
    if(k>=n){
        cout<<0<<endl;
    }else{
        ll sum = 0;
        for(int i = k; i < n; i++){
            sum += a[i];
        }
        cout<<sum<<endl;
    }
    return 0;
   
   }