This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
int main() {
speedup
int n, k;
cin >> n >> k;
vector<pair<int, int>> array(n);
for (int i = 0; i < n; i++){
cin >> array[i].first;
array[i].second = i;
}
sort(array.begin(), array.end());
vector<int> a(n), l;
for (int i = 0; i < n; i++){
a[array[i].second] = i/k;
}
for (int i = 0; i < n; i++){
auto pos = upper_bound(l.begin(), l.end(), a[i]);
if (pos == l.end()){
l.push_back(a[i]);
}else{
*pos = a[i];
}
}
cout << n-l.size() << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |