249652026-02-17 10:18:17KevinKikötők (35 pont)cpp17Accepted 35/3524ms2360 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, m; cin >> n >> m;
    vector<ll> vec(n+1);
    for (ll i=0; i<m; i++){
        ll a, b; cin >> a >> b;
        vec[a-1]++; vec[b]--;
        vec[a]++; vec[b-1]--;
    }
    ll curr=0, out=0, sorszam=0;
    for (ll i=0; i<n; i++){
        curr+=vec[i];
        if (curr>out){
            out=curr;
            sorszam=i+1;
        }
    }
    cout << sorszam << ' ' << out;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms500 KiB
2Accepted0/023ms2356 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms372 KiB
7Accepted1/11ms316 KiB
8Accepted2/21ms564 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms508 KiB
12Accepted2/21ms316 KiB
13Accepted2/21ms316 KiB
14Accepted2/22ms564 KiB
15Accepted2/22ms564 KiB
16Accepted2/221ms1960 KiB
17Accepted2/223ms2124 KiB
18Accepted2/23ms1076 KiB
19Accepted2/24ms1076 KiB
20Accepted2/220ms2100 KiB
21Accepted2/223ms2360 KiB
22Accepted2/224ms2356 KiB