Submission #20712389

Source Code Expand

n = int(input())
alist = []
blist = []
for i in range(n):
    a, b = map(int, input().split())
    alist.append(a)
    blist.append(b)
min_a = min(alist)
min_b = min(blist)
min_a_index = alist.index(min_a)
min_b_index = blist.index(min_b)
if min_a_index == min_b_index:
    time_a = min_a + min_b
    alist.pop(min_a_index)
    blist.pop(min_b_index)
    time_b = max(min(alist), min_b)
    time_c = max(min_a, min(blist))
    print(min(time_a, time_b, time_c))
else:
    print(max(min_a, min_b))

Submission Info

Submission Time
Task B - Job Assignment
User QmanEnobikto
Language Python (3.8.2)
Score 200
Code Size 517 Byte
Status AC
Exec Time 27 ms
Memory 9148 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 22 ms 9124 KiB
handmade_01.txt AC 20 ms 8992 KiB
handmade_02.txt AC 25 ms 9068 KiB
handmade_03.txt AC 21 ms 8968 KiB
handmade_04.txt AC 25 ms 9000 KiB
random_00.txt AC 24 ms 9100 KiB
random_01.txt AC 27 ms 9104 KiB
random_02.txt AC 23 ms 9024 KiB
random_03.txt AC 27 ms 9104 KiB
random_04.txt AC 21 ms 9132 KiB
random_05.txt AC 23 ms 9148 KiB
random_duplicate_00.txt AC 27 ms 9092 KiB
random_duplicate_01.txt AC 27 ms 9048 KiB
random_duplicate_02.txt AC 21 ms 9068 KiB
random_duplicate_03.txt AC 20 ms 8904 KiB
sample_01.txt AC 25 ms 8880 KiB
sample_02.txt AC 18 ms 8888 KiB
single_00.txt AC 27 ms 8904 KiB
single_01.txt AC 26 ms 9096 KiB
single_02.txt AC 20 ms 8904 KiB
single_03.txt AC 26 ms 9132 KiB