QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #109327 | #6443. Windblume Festival | 1kri# | TL | 1ms | 5752kb | C++14 | 438b | 2023-05-28 14:27:43 | 2023-05-28 14:27:48 |
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--){
cin>>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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5752kb
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
Time Limit Exceeded
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 ...