113962024-09-06 15:09:0142Találkozáspython3Accepted 55/55145ms11088 KiB
from sys import stdin
input=stdin.readline
def main():
 N=int(input())
 fele=(N+1)//2
 erk=[0]*N
 tav=[0]*N
 for i in range(N):
   a,b=map(int,input().split())
   erk[i]=a
   tav[i]=b
 tav.sort()
 if N<=2:
  print(1)
  print(erk[0],erk[0])
  return
 l=fele
 x=0
 y=fele-1
 res=erk[y]-tav[x]
 resx=x
 resy=y
 while y<N:
  if res<0:
      print(1)
      print(erk[y],erk[y])
      return
  if l>fele:
   x+=1
   l-=1
   cur=erk[y]-tav[x]
   if cur<res:
    res=cur
    resx=x
    resy=y
  else:
   y+=1
   l+=1
   if y<N:
    cur=erk[y]-tav[x]
    if cur<res:
     res=cur
     resx=x
     resy=y
 print(res+1)
 print(tav[resx],erk[resy])
main()
SubtaskSumTestVerdictTimeMemory
base55/55
1Accepted0/017ms3176 KiB
2Accepted0/0143ms11088 KiB
3Accepted2/217ms3248 KiB
4Accepted2/217ms3264 KiB
5Accepted2/217ms3176 KiB
6Accepted2/217ms3176 KiB
7Accepted2/217ms3180 KiB
8Accepted3/317ms3220 KiB
9Accepted3/317ms3216 KiB
10Accepted3/318ms3460 KiB
11Accepted3/323ms3820 KiB
12Accepted3/328ms3848 KiB
13Accepted3/327ms3796 KiB
14Accepted3/337ms4624 KiB
15Accepted3/337ms4456 KiB
16Accepted3/335ms4388 KiB
17Accepted3/337ms4628 KiB
18Accepted3/350ms5480 KiB
19Accepted3/3100ms10972 KiB
20Accepted3/3112ms9428 KiB
21Accepted3/3145ms10908 KiB
22Accepted3/3141ms10896 KiB