Submission #75243462

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main() {
    int N;
    cin >> N;
    int K;
    cin >> K;
    int64_t ans = 0;
    vector<int64_t> A(N);
    for (int i = 0; i < N; i++) {
      cin >> A.at(i);
    }
    sort(A.begin(), A.end());
    vector<int64_t> num(N);
    int cur = 0;
    for (int i = 0; i < N; i++) {
      num.at(cur) += A.at(i);
      if (i < N-1) {
      if (A.at(i+1) != A.at(i)) {
        cur++;
      }
      }
    }
    sort(num.begin(), num.end());
    reverse(num.begin(), num.end());
    for (int i = 0; i < K; i++) {
      num.at(i) = 0;
    }
    int numsize = num.size();
    for (int i = 0; i < numsize; i++) {
      ans += num.at(i);
    }
    cout << ans << endl;
    return 0;
  }

Submission Info

Judge Result