238122026-01-30 08:53:17ercseferencTelefonközpont (40 pont)cpp17Wrong answer 37/4083ms3576 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=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
base37/40
1Accepted0/04ms3380 KiB
2Accepted0/083ms3380 KiB
3Accepted2/24ms3396 KiB
4Accepted2/24ms3544 KiB
5Accepted2/24ms3348 KiB
6Accepted2/214ms3408 KiB
7Accepted2/246ms3536 KiB
8Accepted3/341ms3380 KiB
9Accepted3/352ms3540 KiB
10Accepted3/375ms3576 KiB
11Accepted3/376ms3380 KiB
12Wrong answer0/337ms3552 KiB
13Accepted3/375ms3380 KiB
14Accepted3/337ms3564 KiB
15Accepted3/339ms3540 KiB
16Accepted3/371ms3380 KiB
17Accepted3/375ms3572 KiB