Submission #364995

#	Time	Username	Problem	Language	Result	Execution time	Memory
364995		vishesh312	Studentsko (COCI14_studentsko)	C++17	100 / 100	3 ms	512 KiB

studentsko

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, k;
    cin >> n >> k;
    vector<array<int, 2>> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i][0];
        v[i][1] = i;
    }
    sort(all(v));
    vector<int> cur;
    vector<int> X(n);
    for (int i = 0; i < n; ++i) {
        X[v[i][1]] = i / k;
    }
    for (int x : X) {
        auto it = upper_bound(all(cur), x);
        if (it == cur.end()) {
            cur.push_back(x);
        } else {
            *it = x;
        }
    }
    cout << n - sz(cur) << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10