178372025-09-19 11:06:19DávidZsonglőrködéscpp17Accepted 100/100474ms20668 KiB
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    vector<pair<int, int>> v(n);
    map<int, int> napok;
    for(int i = 0; i < n; i++) cin >> v[i].second >> v[i].first;
    sort(v.begin(), v.end());
    //for(auto i : v) cout << i.second << " " << i.first << endl;
    int cnt = n;
    for(int i = 0; i < n; i++) {
        if(napok[v[i].second] > 0) {
            napok[v[i].second]--;
            cnt--;
        }
        napok[v[i].first]++;
    }
    cout << cnt << endl;
}
// 2 3  3 100  100 200  200 300
// 2 3
// 100 101
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted4ms412 KiB
4Accepted109ms6512 KiB
5Accepted303ms15660 KiB
6Accepted368ms18708 KiB
7Accepted474ms20668 KiB
8Accepted474ms20532 KiB
9Accepted407ms20664 KiB
10Accepted449ms20580 KiB
11Accepted405ms20664 KiB
subtask335/35
12Accepted1ms316 KiB
13Accepted1ms508 KiB
14Accepted1ms316 KiB
15Accepted1ms316 KiB
16Accepted1ms316 KiB
17Accepted2ms316 KiB
18Accepted2ms316 KiB
19Accepted2ms316 KiB
20Accepted2ms316 KiB
subtask445/45
21Accepted4ms564 KiB
22Accepted63ms820 KiB
23Accepted308ms15672 KiB
24Accepted184ms1824 KiB
25Accepted426ms20668 KiB
26Accepted206ms2036 KiB
27Accepted428ms20524 KiB
28Accepted203ms1980 KiB
29Accepted425ms20532 KiB