Submission #1197528

#TimeUsernameProblemLanguageResultExecution timeMemory
1197528primo학생 (COCI14_studentsko)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    
    int n, k;
    cin >> n >> k;

    vector<int> a(n), ap(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        ap[i] = a[i];
    }

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

    for (int i = 0; i < n; ++i) {
        b[i] = (lower_bound(ap.begin(), ap.end(), a[i]) - ap.begin()) / k;
    }

    int ans = 0;
    vector<int> c;
    for (int i = 0; i < n; ++i) {
        int it = upper_bound(c.begin(), c.end(), a[i]) - c.begin();
        if (it == c.size()) c.push_back(a[i]);
    }

    cout << n - (int)c.size() << "\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...