151942025-02-16 12:11:45balintttZebra (75 pont)cpp17Wrong answer 0/751ms748 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> directions(n);
    vector<int> arrival_times(n);

    for (int i = 0; i < n; i++) {
        cin >> directions[i];
        cin >> arrival_times[i];
    }

    sort(arrival_times.begin(), arrival_times.end());

    int total_waiting_time = 0;
    for (int i = 0; i < n; i++) {
        int pedestrian_waiting_time = arrival_times[i] - i;
        total_waiting_time += pedestrian_waiting_time;
    }

    cout << total_waiting_time << endl;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/75
1Wrong answer0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/51ms576 KiB
6Wrong answer0/51ms316 KiB
7Wrong answer0/51ms564 KiB
8Wrong answer0/51ms316 KiB
9Wrong answer0/51ms508 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/51ms532 KiB
12Wrong answer0/51ms748 KiB
13Wrong answer0/51ms316 KiB
14Wrong answer0/51ms316 KiB
15Wrong answer0/51ms316 KiB
16Wrong answer0/51ms316 KiB
17Wrong answer0/51ms316 KiB