제출 #1122702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122702		nrg_studio	학생 (COCI14_studentsko)	C++20	100 / 100	2 ms	328 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define f first
#define s second
#define chmin(a, b) a = min(a,b)
#define chmax(a, b) a = max(a,b)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define all(x) x.begin(),x.end()
#define v vector

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    int n, k; cin >> n >> k;
    v<int> a(n);
    F0R(i,n) {cin >> a[i];}

    v<pii> s(n);
    F0R(i,n) {s[i] = {a[i],i};}
    sort(all(s));
    while (s.size()) {
        v<int> idx;
        F0R(i,k) {
            idx.pb(s[s.size()-i-1].s);
        } sort(all(idx));
        F0R(i,k) {
            a[idx[k-i-1]] = s.back().f;
            s.pop_back();
        }
    }
    v<int> dp;
    for (int i : a) {
        int pos = lower_bound(dp.begin(),dp.end(),i)-dp.begin();
        if (pos==dp.size()) {dp.pb(i);}
        else {dp[pos]=i;}
    }
    cout << n-dp.size() << '\n';
}

• 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