Submission #1342447

#TimeUsernameProblemLanguageResultExecution timeMemory
1342447nathlol2Studentsko (COCI14_studentsko)C++20
100 / 100
2 ms580 KiB
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 5;
int n, k, a[N];
vector<int> v, lis;
map<int, int> mp;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> k;
    for(int i = 1;i<=n;i++) cin >> a[i], v.push_back(a[i]);
    sort(v.begin(), v.end());
    for(int i = 0;i<n;i++){
        mp[v[i]] = i / k;
    }
    for(int i = 1;i<=n;i++) a[i] = mp[a[i]];
    for(int i = 1;i<=n;i++){
        auto it = upper_bound(lis.begin(), lis.end(), a[i]);
        if(it == lis.end()) lis.push_back(a[i]);
        else *it = a[i];
    }
    cout << n - lis.size();
}
#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...