# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055766 | 2024-08-13T05:08:10 Z | manhlinh1501 | Autići (COCI22_autici) | C++17 | 6 ms | 1524 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); i64 ans = accumulate(a + 1, a + N + 1, 0LL) + a[1] * (N - 2); cout << ans; return (0 ^ 0); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 860 KB | Output is correct |
3 | Incorrect | 6 ms | 1524 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 604 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 3 ms | 860 KB | Output is correct |
3 | Incorrect | 6 ms | 1524 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |