231262026-01-16 12:53:48ercseferencTalálkozáscpp17Wrong answer 50/5567ms1112 KiB
#include <bits/stdc++.h>
using namespace std;
int a[100001],b[100002];
int main()
{
    //ifstream f("szamok.txt");
    int n; cin>>n;
    for(int i=0; i<n; i++){
        int x,y; cin>>x>>y;
        a[x]++; b[y+1]++;}
    int x=1,y=1,mini=100001,minx,miny,k=(n+1)/2,tart=a[1];
    while(x<100001){
        while(tart<k && y<100000){y++; tart+=a[y];}
        if(tart>=k && y-x<mini){mini=y-x; minx=x; miny=y;}
        x++; tart-=b[x];}
    cout<<mini+1<<endl<<minx<<" "<<miny;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/55
1Accepted0/02ms316 KiB
2Accepted0/064ms1076 KiB
3Wrong answer0/22ms316 KiB
4Accepted2/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/22ms316 KiB
7Accepted2/22ms316 KiB
8Accepted3/32ms316 KiB
9Accepted3/32ms484 KiB
10Accepted3/32ms508 KiB
11Accepted3/34ms632 KiB
12Accepted3/37ms564 KiB
13Accepted3/38ms744 KiB
14Accepted3/313ms784 KiB
15Accepted3/313ms804 KiB
16Accepted3/313ms704 KiB
17Accepted3/313ms572 KiB
18Accepted3/320ms1016 KiB
19Wrong answer0/367ms564 KiB
20Accepted3/359ms420 KiB
21Accepted3/365ms984 KiB
22Accepted3/365ms1112 KiB