147642025-02-02 10:42:10TakacsAndrasUtazásszervezés (75 pont)cpp17Accepted 75/754ms756 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,k,m,c; cin >> n >> k >> m >> c;
    vector<pair<int,int>> a(k+1);
    for (int i = 0; i < c; i++) {
        int x; cin >> x;
        a[x].first++;
    }
    int out = 0;
    for (int i = 1; i <= k; i++) {
        n += a[i].second;
        if (a[i].first >= 1 && n > 0) {
            out += min(a[i].first,n);
            a[i+m].second = min(a[i].first,n);
            n -= min(a[i].first,n);
        }
    }
    cout << out;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/04ms748 KiB
3Accepted3/31ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted5/51ms316 KiB
10Accepted5/52ms316 KiB
11Accepted6/62ms316 KiB
12Accepted6/63ms564 KiB
13Accepted6/63ms564 KiB
14Accepted6/64ms756 KiB
15Accepted6/64ms564 KiB
16Accepted6/64ms564 KiB
17Accepted6/64ms568 KiB