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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) x.begin(), x.end()
const int INF = 2e9, N = 55, M = 998244353, LOG = 16;
const ll LINF = 1e18;
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, k; 
    cin >> n >> k;
    vector<int> v(n), p(n);
    for(int& x: v) cin >> x;
    iota(all(p), 0);
    sort(all(p), [&](int i, int j) {
        return v[i] < v[j];
    });
    for(int i = 0; i < n; i++) 
        v[p[i]] = i / k;
        
    vector<int> dp(n, 1);
    for(int i = 0; i < n; i++) 
        for(int j = 0; j < i; j++)
            if(v[j] <= v[i])
                dp[i] = max(dp[i], dp[j] + 1);
    
    cout << n - *max_element(all(dp));
}
| # | 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... |