QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #859627 | #9717. Defuse the Bombs | zhenghanyun | WA | 11ms | 9088kb | Python3 | 188b | 2025-01-17 21:16:12 | 2025-01-17 21:16:35 |
Judging History
answer
I=input;
for i in range(int(I())):
I();a=sorted(map(int,I().split()))+[9e9];s=m=a[0]
for j in range(1,len(a)):
s+=a[j];m+=(s//j-m)*(a[j]<=s/j<a[j+1])
print(f"Case #{i+1}: {m+1}")
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 11ms
memory: 9088kb
input:
2 2 1 1 3 1 2 3
output:
Case #1: 3.0 Case #2: 4.0
result:
wrong answer 1st lines differ - expected: 'Case #1: 3', found: 'Case #1: 3.0'