/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 320.0 KiB
#3 Accepted 48ms 584.0 KiB
#4 Wrong Answer 107ms 2.434 MiB
#5 Wrong Answer 270ms 4.059 MiB
#6 Accepted 187ms 4.055 MiB
#7 Wrong Answer 103ms 616.0 KiB
#8 Wrong Answer 122ms 1.039 MiB
#9 Wrong Answer 66ms 2.668 MiB
#10 Wrong Answer 63ms 568.0 KiB
#11 Wrong Answer 38ms 324.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(b) cout << (b ? "YES" : "NO") << '\n'
#define pc cout << "Case " << tc << ": "
#ifdef LOCAL
#include "def.h"
#else
#define ck(...) 
#endif
const ll M = 1e9 + 7, N = 2e5 + 5;

void test(int tc) {
    ll a = 0, b = 0, c = 0, d = 0, i = 0, j = 0, k = 0, m = 0, n = 0, q = 0;
    cin >> n >> k;
    map<ll, ll> mp;
    for (i = 0; i < n; ++i) { cin >> a;
        mp[a]++;
    }
    multimap<int, int, greater<>> mmp;  // descending order
    for(auto &[f, s]:mp) mmp.emplace(s, f);
    a = 0;
    while(n){
        if(a==0) a = k;
        for(auto [f,s]:mmp){
            if(mp[s]==0) {
                c++;
            }
            else{
                mp[s]--;
            }
            --n;
            if(--a == 0 or !n)
                break;
        }
    }
    cout << c;
    cout << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit|cin.badbit);
    int tc = 0, t = 1;
    cin >> t;
    while (tc < t) test(++tc);
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1062 Roy and Array
Contest
Brain Booster #4
Language
C++20 (G++ 13.2.0)
Submit At
2024-07-14 16:48:21
Judged At
2024-10-03 13:36:56
Judged By
Score
25
Total Time
270ms
Peak Memory
4.059 MiB