Submission #75249896

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>

#define LF putchar('\n')

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 998244353LL; //1000000007LL;
static const LLONG INF_NUM = 1e18;
static const int CH_KIND = 'z' - 'a' + 1;
template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}
template <class _T> static _T tp_pow(int x, int exp)
{
	_T ans = 1;
	_T base = x;
	while (exp > 0) {
		if (exp & 1) {
			ans = (ans * base);
		}
		base = (base * base);
		exp >>= 1;
	}
	return ans;
}

static void task();

int main()
{
	task();
	fflush(stdout);
	return 0;
}

static void task()
{
    int N, K;
    get(N, K);

    std::map<LLONG, LLONG> sums;
    for (int i = 0; i < N; i++) {
        LLONG n;
        get(n);

        sums[n] += n;
    }
    std::vector<LLONG> vals;
    for (auto p : sums) {
        vals.push_back(p.second);
    }
    std::sort(vals.begin(), vals.end(), std::greater<LLONG>());

    for (int i = 0; i < std::min(K, (int)vals.size()); i++) {
        vals[i] = 0;
    }
    LLONG ans = 0;
    for (auto v : vals) ans+= v;
    printf("%lld\n", ans);
}

Submission Info

Judge Result