Submission

PPPPPPPPPP

Score: 100

User: Winzzwz

Problemset: พอด

Language: cpp

Time: 0.020 second

Submitted On: 2025-03-05 13:15:46

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n,k;
map <int,int> cnt;
set <int> check;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        int nn; cin >> nn;
        cnt[nn]++;
        if (check.find(nn) == check.end()) check.insert(nn);
        //cout << i << " : " << check.size() << "\n";
        if (check.size() == k) {
            check.clear();
            for (int j = 1; j <= k; j++) {
                cnt[j]--;
                if (cnt[j] && check.find(j) == check.end()) check.insert(j);
            }
        }
    }
    int sum = 0;
    for (int i = 1; i <= k; i++) sum += cnt[i];
    cout << sum;

    return 0;
}