# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055752 | 2024-08-13T04:58:05 Z | manhlinh1501 | Autići (COCI22_autici) | C++17 | 7 ms | 1844 KB |
#include <bits/stdc++.h> using namespace std; using i64 = long long; const int MAXN = 1e5 + 5; int N; int a[MAXN]; i64 ans = 0; signed main() { #define TASK "code" if (fopen(TASK ".inp", "r")) { freopen(TASK ".inp", "r", stdin); freopen(TASK ".out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> N; if(N == 1) return cout << 0, 0; for(int i = 1; i <= N; i++) cin >> a[i]; sort(a + 1, a + N + 1); for(int i = 1; i < N - 1; i++) ans += 2 * a[i]; ans += a[N] + a[N - 1]; cout << ans; return (0 ^ 0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 3 ms | 860 KB | Output is correct |
3 | Correct | 6 ms | 1844 KB | Output is correct |
4 | Correct | 6 ms | 1628 KB | Output is correct |
5 | Correct | 7 ms | 1628 KB | Output is correct |
6 | Correct | 6 ms | 1500 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Incorrect | 0 ms | 348 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 3 ms | 860 KB | Output is correct |
3 | Correct | 6 ms | 1844 KB | Output is correct |
4 | Correct | 6 ms | 1628 KB | Output is correct |
5 | Correct | 7 ms | 1628 KB | Output is correct |
6 | Correct | 6 ms | 1500 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Incorrect | 0 ms | 348 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |