178352025-09-19 10:48:00DávidZsonglőrködéscpp17Wrong answer 20/100328ms11316 KiB
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, cnt = 0;
    cin >> n;
    vector<pair<int, int>> v(n);
    map<int, int> napok;
    for(int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
    sort(v.begin(), v.end());
    cnt = n;
    for(int i = 0; i < n; i++) {
        if(napok.count(v[i].first)) {
            napok[v[i].first]--;
            cnt--;
        }
        napok[v[i].second]++;
    }
    cout << cnt << endl;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted4ms316 KiB
4Accepted90ms3704 KiB
5Accepted238ms8500 KiB
6Accepted294ms10268 KiB
7Accepted321ms11196 KiB
8Accepted326ms11316 KiB
9Accepted321ms11316 KiB
10Accepted326ms11316 KiB
11Accepted321ms11316 KiB
subtask30/35
12Accepted1ms316 KiB
13Wrong answer1ms508 KiB
14Wrong answer1ms316 KiB
15Wrong answer1ms316 KiB
16Wrong answer1ms316 KiB
17Wrong answer2ms412 KiB
18Wrong answer2ms508 KiB
19Wrong answer2ms332 KiB
20Wrong answer2ms316 KiB
subtask40/45
21Accepted3ms316 KiB
22Wrong answer63ms884 KiB
23Accepted243ms8500 KiB
24Wrong answer187ms1588 KiB
25Accepted326ms11316 KiB
26Wrong answer210ms1844 KiB
27Accepted328ms11316 KiB
28Wrong answer208ms1848 KiB
29Accepted321ms11316 KiB