提出 #75241537

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
int main() {
  ll sum = 0;
  map<ll,int> mp;
  int n,k;
  cin >> n >> k;
  REP(i,n) {
    int A;
    cin >> A;
    sum += A;
    mp[A]++;
  }

  // printf("sum:%lld\n", sum);

  vector<ll> a_accum;
  for(auto p:mp) {
    a_accum.push_back(p.first*p.second);
  }

  sort(a_accum.begin(), a_accum.end());

  int accum_size = a_accum.size();
  int limit_l = max(0, accum_size-1-(k-1));
  REV(i, accum_size-1, limit_l) {
    sum -= a_accum[i];
  }

  // printf("sum:%lld\n", sum);

  cout << sum << endl;
}

提出情報

ジャッジ結果