Submission #4111739

Source Code Expand

res = 0
n = int(input())
l = []
for i in range(n):
    a, b = map(int,input().split())
    l.append([a + b, a, b])
l = sorted(l)[::-1]
for i in range(n):
    if i % 2 == 0:
        res += l[i][1]
    else:
        res -= l[i][2]
print(res)

Submission Info

Submission Time
Task C - Different Strokes
User morio__
Language Python (3.4.3)
Score 400
Code Size 253 Byte
Status AC
Exec Time 606 ms
Memory 24404 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 18 ms 2940 KiB
a02 AC 18 ms 2940 KiB
a03 AC 18 ms 2940 KiB
b04 AC 18 ms 3060 KiB
b05 AC 368 ms 21128 KiB
b06 AC 380 ms 21156 KiB
b07 AC 584 ms 24348 KiB
b08 AC 577 ms 24352 KiB
b09 AC 606 ms 24364 KiB
b10 AC 567 ms 24404 KiB
b11 AC 574 ms 24404 KiB
b12 AC 572 ms 24400 KiB
b13 AC 591 ms 24356 KiB