251772026-02-18 11:07:37MatematikaTelefonközpont (40 pont)cpp17Accepted 40/4029ms3268 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
	int n; cin >> n;
    vector<int> vec(400000);
    for(int i=0; i<n; i++)
    {
        int a,b; cin >> a >> b;
        vec[a-1]++;
        vec[b]--;
    }
    int legn=vec[0];
    for(int i=1; i<vec.size(); i++)
    {
        vec[i]+=vec[i-1];
        legn=max(legn, vec[i]);
        //cerr << vec[i] << " ";
    }
    cout << legn;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1844 KiB
2Accepted0/029ms3124 KiB
3Accepted2/23ms1844 KiB
4Accepted2/23ms1844 KiB
5Accepted2/23ms1896 KiB
6Accepted2/26ms2100 KiB
7Accepted2/214ms2352 KiB
8Accepted3/314ms2496 KiB
9Accepted3/318ms2616 KiB
10Accepted3/323ms2100 KiB
11Accepted3/327ms3268 KiB
12Accepted3/316ms2356 KiB
13Accepted3/326ms3268 KiB
14Accepted3/316ms2100 KiB
15Accepted3/316ms2240 KiB
16Accepted3/325ms2556 KiB
17Accepted3/325ms3068 KiB