Submission #1265940

#TimeUsernameProblemLanguageResultExecution timeMemory
1265940canhnam357Studentsko (COCI14_studentsko)C++20
100 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> a(n); for (int& i : a) cin >> i; vector<int> ord(n); iota(all(ord), 0); sort(all(ord), [&](int i, int j) {return a[i] < a[j]; }); for (int i = 0; i < n; i++) a[ord[i]] = i / k; set<pair<int, int>> s; for (int i = 0; i < n; i++) { auto it = s.lower_bound(make_pair(a[i], i)); if (it != s.end()) s.erase(it); s.insert(make_pair(a[i], i)); } cout << n - s.size(); 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...