Submission #20734963

Source Code Expand

""" O(N) solution """

N = int(input())
A, B = [], []
for _ in range(N):
  a, b = map(int, input().split())
  A.append(a)
  B.append(b)

i = A.index(min(A))
j = B.index(min(B))

if i == j:
  a, b = A[i], B[i]
  del A[i]
  del B[i]
  ans = min(a + b, max(min(A), b), max(a, min(B)))
else:
  ans = max(A[i], B[j])

print(ans)

Submission Info

Submission Time
Task B - Job Assignment
User maspy
Language Python (3.8.2)
Score 200
Code Size 343 Byte
Status AC
Exec Time 28 ms
Memory 9228 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All handmade_00.txt, handmade_01.txt, handmade_02.txt, handmade_03.txt, handmade_04.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_duplicate_00.txt, random_duplicate_01.txt, random_duplicate_02.txt, random_duplicate_03.txt, sample_01.txt, sample_02.txt, single_00.txt, single_01.txt, single_02.txt, single_03.txt
Case Name Status Exec Time Memory
handmade_00.txt AC 28 ms 9160 KiB
handmade_01.txt AC 25 ms 8924 KiB
handmade_02.txt AC 19 ms 9084 KiB
handmade_03.txt AC 28 ms 9084 KiB
handmade_04.txt AC 20 ms 9084 KiB
random_00.txt AC 20 ms 8944 KiB
random_01.txt AC 23 ms 8952 KiB
random_02.txt AC 24 ms 8956 KiB
random_03.txt AC 25 ms 8952 KiB
random_04.txt AC 18 ms 9028 KiB
random_05.txt AC 19 ms 9228 KiB
random_duplicate_00.txt AC 24 ms 8948 KiB
random_duplicate_01.txt AC 27 ms 9188 KiB
random_duplicate_02.txt AC 27 ms 9156 KiB
random_duplicate_03.txt AC 19 ms 9176 KiB
sample_01.txt AC 24 ms 9160 KiB
sample_02.txt AC 17 ms 8928 KiB
single_00.txt AC 26 ms 8948 KiB
single_01.txt AC 25 ms 9060 KiB
single_02.txt AC 19 ms 8944 KiB
single_03.txt AC 23 ms 9028 KiB