QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#859315#9717. Defuse the BombszhenghanyunRE 0ms0kbPython3195b2025-01-17 17:20:332025-01-17 17:20:33

Judging History

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

  • [2025-01-17 17:20:33]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2025-01-17 17:20:33]
  • 提交

answer

I=input,R=range
for i in R(int(I())):
	I();a=sorted(map(int,I().split()))+[9e9];s=m=a[0]
	for j in R(1,len(a)):
		s+=a[j];m=s/j if a[j]<=s/j<=a[j+1] else m
	print(f"Case #{i+1}: {int(m)+1}")

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Runtime Error

input:

2
2
1 1
3
1 2 3

output:


result: