135342025-01-08 09:29:11feheristvanTalálkozáscpp17Accepted 55/5568ms1312 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    int megy[100001] = {0};
    int jon[100001] = {0};
    int x, y, maxx = 0;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x >> y;
        jon[x]++;
        megy[y]++;
        if (y > maxx)
            maxx = y;
    }
    int lx, ly, j = 0, ossz = 0, db = 100001;
    bool t = 1;
     for(int i = 1; i <= maxx; i++){
        while(j < maxx && ossz < (n + 1) / 2){
            j++;
            ossz += jon[j];
        }
        if(j == maxx && ossz < (n + 1) / 2){
            t = 0;
        }
        if(j - i + 1 < db && ossz >= (n + 1) / 2 && t && j - i + 1 > 0){
            db = j - i + 1;
            ly = j;
            lx = i;
        }
        ossz -= megy[i];
    }
    cout << db << endl;
    cout <<lx << " " << ly;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/02ms1268 KiB
2Accepted0/067ms1260 KiB
3Accepted2/22ms1076 KiB
4Accepted2/21ms1076 KiB
5Accepted2/22ms1076 KiB
6Accepted2/22ms1268 KiB
7Accepted2/22ms1076 KiB
8Accepted3/32ms1076 KiB
9Accepted3/32ms1076 KiB
10Accepted3/32ms1076 KiB
11Accepted3/36ms1076 KiB
12Accepted3/37ms1076 KiB
13Accepted3/37ms1180 KiB
14Accepted3/314ms1260 KiB
15Accepted3/314ms1180 KiB
16Accepted3/313ms1076 KiB
17Accepted3/313ms1172 KiB
18Accepted3/320ms1312 KiB
19Accepted3/368ms1076 KiB
20Accepted3/363ms1176 KiB
21Accepted3/365ms1180 KiB
22Accepted3/365ms1076 KiB