161422025-04-06 15:54:12buzaszendvicsUtazásszervezés (75 pont)cpp17Accepted 75/754ms600 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, k, m, c;

    cin >> n >> k >> m >> c;

    int foglalt[10] = {0};
    int db = 0;

    for (int i = 0; i < c; i ++) {
        int kezdn;
        cin >> kezdn;
        for (int j = 0; j < n; j ++) {
            if (foglalt[j] < kezdn) {
                db ++;
                foglalt[j] = kezdn + m - 1;
                break;
            }
        }
    }

    cout << db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms316 KiB
2Accepted0/04ms316 KiB
3Accepted3/31ms316 KiB
4Accepted4/41ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/41ms316 KiB
8Accepted4/41ms316 KiB
9Accepted5/51ms512 KiB
10Accepted5/52ms316 KiB
11Accepted6/62ms316 KiB
12Accepted6/64ms600 KiB
13Accepted6/63ms440 KiB
14Accepted6/64ms316 KiB
15Accepted6/64ms444 KiB
16Accepted6/64ms380 KiB
17Accepted6/64ms316 KiB