QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #109329 | #6443. Windblume Festival | 1kri# | WA | 188ms | 5788kb | C++14 | 448b | 2023-05-28 14:28:25 | 2023-05-28 14:28:29 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
int t,n,a[1000005];
int c[1000005];
signed main(){
cin>>t;
while(t--){
scanf("%lld",&n);
int sum=0;
for (int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum+=a[i];
c[i]=-2*a[i];
}
sort(c+1,c+1+n);
sum+=c[n];
for (int i=2;i<=n-1;i++)
if (c[n-i+1]>0)sum+=c[n-i+1];
printf("%lld\n",sum);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 5652kb
input:
5 4 1 -3 2 -4 11 91 66 73 71 32 83 72 79 84 33 93 12 91 66 73 71 32 83 72 79 84 33 33 93 13 91 66 73 71 32 83 72 79 84 33 33 33 93 1 0
output:
10 713 746 779 0
result:
ok 5 number(s): "10 713 746 779 0"
Test #2:
score: -100
Wrong Answer
time: 188ms
memory: 5788kb
input:
1000000 1 2 1 -2 1 1 1 -1 1 2 1 1 1 2 1 -2 1 -2 1 2 1 1 1 1 1 2 1 2 1 2 1 -2 1 -2 1 0 1 2 1 1 1 -1 1 0 1 -2 1 0 1 1 1 1 1 -2 1 -2 1 2 1 1 1 2 1 1 1 1 1 0 1 2 1 0 1 -1 1 -1 1 -2 1 -2 1 0 1 -2 1 0 1 1 1 -1 1 2 1 0 1 -2 1 -2 1 0 1 1 1 -1 1 -2 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 1 1 2 1 0 1 0 1 -2 1 2 1 2 1 ...
output:
-2 2 -1 1 -2 -1 -2 2 2 -2 -1 -1 -2 -2 -2 2 2 0 -2 -1 1 0 2 0 -1 -1 2 2 -2 -1 -2 -1 -1 0 -2 0 1 1 2 2 0 2 0 -1 1 -2 0 2 2 0 -1 1 2 1 0 1 1 1 1 -1 -2 0 0 2 -2 -2 1 -2 2 1 2 1 2 -2 1 1 0 2 0 0 0 -1 -1 -2 -1 1 0 2 -1 -2 -1 -1 0 -1 -2 2 1 1 0 2 -2 -2 -1 0 1 0 1 0 -1 2 -2 -1 2 2 0 1 -1 1 -2 2 -2 -1 -1 -2 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '-2'