249662026-02-17 10:20:49MatematikaKikötők (35 pont)cpp17Accepted 35/3570ms1184 KiB
#include <bits/stdc++.h>
#include <random>
using namespace std;

int main() {
	long long n,m, legn=0, ind=-1;; cin >> n >> m;
    vector<long long> vec(n+1);
    for(int i=0; i<m; i++)
    {
        int a,b; cin >> a >> b;a--;b--;
        vec[a]++;
        vec[a+1]++;
        vec[b]--;
        vec[b+1]--;
    }
    for(int i=1; i<n; i++)
    {
        vec[i]+=vec[i-1];
        if(legn<vec[i])
        {
            legn=vec[i];
            ind=i+1;
        }
    }
    cout << ind << " " << legn;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/070ms1076 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/22ms560 KiB
11Accepted2/22ms316 KiB
12Accepted2/22ms316 KiB
13Accepted2/22ms472 KiB
14Accepted2/24ms564 KiB
15Accepted2/24ms748 KiB
16Accepted2/267ms564 KiB
17Accepted2/268ms820 KiB
18Accepted2/26ms1060 KiB
19Accepted2/27ms1088 KiB
20Accepted2/261ms1112 KiB
21Accepted2/268ms1184 KiB
22Accepted2/268ms1076 KiB