252142026-02-18 13:19:28KevinTelefonközpont (40 pont)cpp17Accepted 40/4035ms3572 KiB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n; cin >> n;
    vector<ll> vec(400001);
    for (ll i=0; i<n; i++){
        ll a, b; cin >> a >> b;
        vec[a-1]++;
        vec[b]--;
    }
    ll curr=0;
    ll out=0;
    for (ll i=0; i<400001; i++){
        curr+=vec[i];
        out=max(out, curr);
    }
    cout << out;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/04ms3572 KiB
2Accepted0/035ms3380 KiB
3Accepted2/24ms3380 KiB
4Accepted2/24ms3380 KiB
5Accepted2/24ms3380 KiB
6Accepted2/28ms3384 KiB
7Accepted2/217ms3460 KiB
8Accepted3/319ms3380 KiB
9Accepted3/319ms3396 KiB
10Accepted3/326ms3312 KiB
11Accepted3/332ms3380 KiB
12Accepted3/317ms3320 KiB
13Accepted3/334ms3324 KiB
14Accepted3/317ms3380 KiB
15Accepted3/317ms3360 KiB
16Accepted3/328ms3380 KiB
17Accepted3/328ms3380 KiB