Submission #3697181

Source Code Expand

def inpl(): return [int(i) for i in input().split()]
N = int(input())
A, B = [], []
for _ in range(N):
    a, b = inpl()
    A.append(a)
    B.append(b)
C = [B[i] for i in range(N) if A[i] > B[i]]
if not C:
    c = sum(A)
else:
    c = min(C)
print(sum(A)-c)

Submission Info

Submission Time
Task E - Tozan and Gezan
User Tallfall
Language Python (3.4.3)
Score 700
Code Size 270 Byte
Status AC
Exec Time 86 ms
Memory 4852 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 35
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 82 ms 4724 KB
02.txt AC 82 ms 4724 KB
03.txt AC 82 ms 4828 KB
04.txt AC 80 ms 4828 KB
05.txt AC 83 ms 4824 KB
06.txt AC 82 ms 4724 KB
07.txt AC 79 ms 4724 KB
08.txt AC 83 ms 4828 KB
09.txt AC 79 ms 4596 KB
10.txt AC 79 ms 4852 KB
11.txt AC 81 ms 4848 KB
12.txt AC 82 ms 4852 KB
13.txt AC 84 ms 4852 KB
14.txt AC 80 ms 4852 KB
15.txt AC 82 ms 4852 KB
16.txt AC 78 ms 4852 KB
17.txt AC 81 ms 4596 KB
18.txt AC 79 ms 4596 KB
19.txt AC 86 ms 4628 KB
20.txt AC 82 ms 4628 KB
21.txt AC 82 ms 4624 KB
22.txt AC 81 ms 4724 KB
23.txt AC 83 ms 4624 KB
24.txt AC 84 ms 4624 KB
25.txt AC 82 ms 4724 KB
26.txt AC 80 ms 4624 KB
27.txt AC 81 ms 4792 KB
28.txt AC 83 ms 4724 KB
29.txt AC 83 ms 4828 KB
30.txt AC 82 ms 4824 KB
31.txt AC 17 ms 3064 KB
32.txt AC 17 ms 3064 KB
s1.txt AC 17 ms 3060 KB
s2.txt AC 17 ms 3064 KB
s3.txt AC 17 ms 3060 KB