195212025-12-12 14:39:29birozsTalálkozáspython3Time limit exceeded 18/55301ms11572 KiB
N = int(input())
Be = [0] * (100001)
Ki = [0] * (100001)
maxT = 0
for _ in range(N):
    A,B = map(int,input().split())
    Be[A] += 1
    Ki[B] += 1
    if B > maxT:
        maxT = B
if N % 2 == 0:
    F = N // 2
else:
    F = N // 2 + 1
for i in range(1,maxT):
    Be[i] = Be[i-1] + Be[i]
    Ki[i] = Ki[i-1] + Ki[i]
Be = Be[:maxT]
Ki = Ki[:maxT]
minTav = maxT
for i in range(1,maxT):
    if Be[i] >= F and Be[i] > Be[i-1]:
        for j in range(i,0,-1):
            if Be[i] - Ki[j] >= F - 1 and  Ki[j] != Ki[j-1]:
                if i-j < minTav:
                    minTav = i - j
                    minPar = [j,i]
                break
print(minTav+1)
print(*minPar)
SubtaskSumTestVerdictTimeMemory
base18/55
1Accepted0/018ms4660 KiB
2Time limit exceeded0/0289ms11572 KiB
3Partially correct1/217ms4676 KiB
4Accepted2/218ms4660 KiB
5Accepted2/218ms4652 KiB
6Accepted2/271ms4660 KiB
7Accepted2/297ms4680 KiB
8Accepted3/341ms4652 KiB
9Accepted3/3112ms4660 KiB
10Accepted3/3150ms4668 KiB
11Time limit exceeded0/3300ms8088 KiB
12Time limit exceeded0/3284ms8124 KiB
13Time limit exceeded0/3289ms8244 KiB
14Time limit exceeded0/3300ms8244 KiB
15Time limit exceeded0/3293ms8244 KiB
16Time limit exceeded0/3280ms8244 KiB
17Time limit exceeded0/3300ms8072 KiB
18Time limit exceeded0/3301ms11536 KiB
19Time limit exceeded0/3284ms8584 KiB
20Time limit exceeded0/3279ms10172 KiB
21Time limit exceeded0/3300ms11572 KiB
22Time limit exceeded0/3300ms11572 KiB