QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #564462 | #8586. Party | iyedoo | 0 | 8ms | 10648kb | Python3 | 313b | 2024-09-15 01:42:33 | 2024-09-15 01:42:33 |
Judging History
answer
n = int(input())
a = list(map(int, input().split(" ")))
a.sort(reverse=True)
print(a)
happiness = 0
if n <= 200000:
for i in range(n):
if n % 2 == 0:
if i + 1 <= n // 2:
happiness += a[i]
else:
if i + 1 <= n // 2 + 1:
happiness += a[i]
print(happiness)
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 10648kb
input:
5 3 2 -1 4 5
output:
[5, 4, 3, 2, -1] 12
result:
wrong answer 1st lines differ - expected: '12', found: '[5, 4, 3, 2, -1]'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%