func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long INF = 1e9 + 7;   const int N = 2e5 + 10;   int per(int tot, int cur) { return (cur * 100 + tot / 2) / tot; }   int main() {     int n, k;     cin >> n >> k;     map<pair<int, int>, int> mc;     queue<int> q;     for (int i = 1; i <= n; i++) {       int x;       cin >> x;       q.push(x);     }     int cur = 0;     map<int, int> ans;     while (!q.empty() || !mc.empty()) {       while (mc.size() < k && !q.empty()) {         mc[make_pair(q.front(), q.size())] = 0;         q.pop();       }       vector<pair<int, int>> vp;       int key = per(n, cur);       for (auto& p : mc) {         p.second++;         if (p.second == key) ans[p.first.second] = 1;         if (p.second == p.first.first) vp.emplace_back(p.first);       }       for (auto& p : vp) mc.erase(p), cur++;     }     printf( %d n , ans.size());     return 0;   }   