제출 #1115076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1115076		duytuandao21	Studentsko (COCI14_studentsko)	C++17	0 / 100	2 ms	2640 KiB

studentsko

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

const int N = 2e6 + 7;
typedef pair<int, int> pii;

int n, k;
int a[N];
pair<int, int> b[N];
map<int, int> pos;

bool cmp(const pii x, const pii y) {
    return x.first > y.first;
}
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> b[i].first;
        b[i].second = i;
    }
    sort (b + 1, b + 1 + n, cmp);
    int cnt = 0;
    for (int i = 1; i <= n; i += k) {
        ++cnt;
        for (int j = i; j <= i + k - 1; j++) a[b[j].second] = cnt;
    }
    int maxVal = 0, res = 0;
    for (int i = n; i > 0; i--) {
        maxVal = max(maxVal, a[i]);
        if (a[i] < maxVal) res++;
    }
    cout << res;
}

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