238132026-01-30 08:56:37ercseferencTelefonközpont (40 pont)cpp17Accepted 40/4079ms3564 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m=400000; cin>>n;
    vector<long long>a(m,0);
    for(int i=0; i<n; i++){
        int x,y; cin>>x>>y;
        a[x-1]++; a[y]--;}
    long long maxi=a[0];
    for(int i=1; i<m; i++){
        a[i]+=a[i-1];
        if(a[i]>maxi)maxi=a[i];}
    cout<<maxi;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/04ms3456 KiB
2Accepted0/079ms3380 KiB
3Accepted2/24ms3380 KiB
4Accepted2/24ms3564 KiB
5Accepted2/24ms3520 KiB
6Accepted2/214ms3380 KiB
7Accepted2/243ms3432 KiB
8Accepted3/341ms3384 KiB
9Accepted3/352ms3548 KiB
10Accepted3/371ms3352 KiB
11Accepted3/378ms3544 KiB
12Accepted3/337ms3380 KiB
13Accepted3/376ms3380 KiB
14Accepted3/337ms3380 KiB
15Accepted3/339ms3380 KiB
16Accepted3/371ms3380 KiB
17Accepted3/375ms3380 KiB