Submission #4020283
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 100005; ll N, arr[MAXN]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> N; ll sum = 0; for (int i = 0; i < N; i++) { cin >> arr[i]; sum += 2*arr[i]; } sort(arr, arr+N, greater<long>()); ll ans = -1; if (N&1) { ll cur = sum; for (int i = N/2+2; i < N; i++) { cur -= 4*arr[i]; } cur -= 3*(arr[N/2] + arr[N/2+1]); ans = cur; cur = sum; for (int i = N/2+1; i < N; i++) { cur -= 4*arr[i]; } cur -= arr[N/2-1] + arr[N/2]; ans = max(ans, cur); } else { ll cur = sum; for (int i = N/2+1; i < N; i++) { cur -= 4*arr[i]; } cur -= arr[N/2-1] + 3*arr[N/2]; ans = cur; } cout << ans << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | C - Align |
User | Fairuzi10 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 778 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 17 ms | 1024 KB |
02.txt | AC | 17 ms | 1024 KB |
03.txt | AC | 17 ms | 1024 KB |
04.txt | AC | 17 ms | 1024 KB |
05.txt | AC | 17 ms | 1024 KB |
06.txt | AC | 17 ms | 1024 KB |
07.txt | AC | 17 ms | 1024 KB |
08.txt | AC | 17 ms | 1024 KB |
09.txt | AC | 17 ms | 1024 KB |
10.txt | AC | 18 ms | 1024 KB |
11.txt | AC | 17 ms | 1024 KB |
12.txt | AC | 17 ms | 1024 KB |
13.txt | AC | 17 ms | 1024 KB |
14.txt | AC | 17 ms | 1024 KB |
15.txt | AC | 17 ms | 1024 KB |
16.txt | AC | 17 ms | 1024 KB |
17.txt | AC | 17 ms | 1024 KB |
18.txt | AC | 17 ms | 1024 KB |
19.txt | AC | 17 ms | 1024 KB |
20.txt | AC | 17 ms | 1024 KB |
21.txt | AC | 16 ms | 1024 KB |
22.txt | AC | 16 ms | 1024 KB |
23.txt | AC | 16 ms | 1024 KB |
24.txt | AC | 16 ms | 1024 KB |
25.txt | AC | 10 ms | 1024 KB |
26.txt | AC | 10 ms | 1024 KB |
27.txt | AC | 10 ms | 1024 KB |
28.txt | AC | 10 ms | 1024 KB |
29.txt | AC | 8 ms | 1024 KB |
30.txt | AC | 10 ms | 1024 KB |
31.txt | AC | 11 ms | 1024 KB |
32.txt | AC | 10 ms | 1024 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 1 ms | 256 KB |
35.txt | AC | 1 ms | 256 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |