QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#523967#8768. Arrested Developmentwuxman57WA 14ms10644kbPython3229b2024-08-19 02:55:152024-08-19 02:55:16

Judging History

你现在查看的是最新测评结果

  • [2024-08-19 02:55:16]
  • 评测
  • 测评结果:WA
  • 用时:14ms
  • 内存:10644kb
  • [2024-08-19 02:55:15]
  • 提交

answer

n = int(input())

a = 0
b = 0

for x in range(0, n):
	line = [int(i) for i in input().split(" ")]
	curr_a, curr_b = line[0], line[1]
	
	if curr_a <= curr_b:
		a += curr_a
	else:
		b += curr_b
	
print(max(a, curr_b))

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 14ms
memory: 10644kb

input:

4
100 1
1 90
1 20
1 20

output:

20

result:

wrong answer 1st lines differ - expected: '3', found: '20'