QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #555623 | #8586. Party | mohamed_ioi | 0 | 16ms | 10608kb | Python3 | 234b | 2024-09-10 06:52:38 | 2024-09-10 06:52:38 |
Judging History
answer
n= int(input())
a = list(map(int, input().split(' ')))
a.sort()
a = a[::-1]
N = n
if n % 2 == 1:
N = n // 2 + 1
hapiness = 0
for i in range(N):
if a[i] >= 0:
hapiness += a[i]
else:
break
print(hapiness)
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 49
Accepted
time: 15ms
memory: 10572kb
input:
5 3 2 -1 4 5
output:
12
result:
ok single line: '12'
Test #2:
score: 49
Accepted
time: 0ms
memory: 10580kb
input:
1 10
output:
10
result:
ok single line: '10'
Test #3:
score: 0
Wrong Answer
time: 16ms
memory: 10608kb
input:
6 1 -3 2 10 -4 9
output:
22
result:
wrong answer 1st lines differ - expected: '21', found: '22'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%