# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
881206 | 2023-11-30T21:26:15 Z | Youssif_Elkadi | Autići (COCI22_autici) | C++17 | 31 ms | 2196 KB |
#include <bits/stdc++.h> using namespace std; const long long N = 2e5 + 5, inf = 1e17 + 5, mod = 1e9 + 7; int main() { int n; cin >> n; long long ans = 0; long long mn = inf, ind; vector<long long> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; if (arr[i] < mn) mn = arr[i], ind = i; } for (int i = 0; i < n; i++) { if (ind == i) continue; ans += mn + arr[i]; } cout << ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 11 ms | 1224 KB | Output is correct |
3 | Correct | 29 ms | 2140 KB | Output is correct |
4 | Correct | 28 ms | 1936 KB | Output is correct |
5 | Correct | 28 ms | 1968 KB | Output is correct |
6 | Correct | 24 ms | 1876 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | 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 | 1 ms | 448 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 444 KB | Output is correct |
7 | Correct | 1 ms | 600 KB | Output is correct |
8 | Correct | 1 ms | 356 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 344 KB | Output is correct |
12 | Correct | 1 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 11 ms | 1224 KB | Output is correct |
3 | Correct | 29 ms | 2140 KB | Output is correct |
4 | Correct | 28 ms | 1936 KB | Output is correct |
5 | Correct | 28 ms | 1968 KB | Output is correct |
6 | Correct | 24 ms | 1876 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 | 1 ms | 448 KB | Output is correct |
11 | Correct | 1 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 444 KB | Output is correct |
13 | Correct | 1 ms | 600 KB | Output is correct |
14 | Correct | 1 ms | 356 KB | Output is correct |
15 | Correct | 1 ms | 348 KB | Output is correct |
16 | Correct | 1 ms | 348 KB | Output is correct |
17 | Correct | 1 ms | 344 KB | Output is correct |
18 | Correct | 1 ms | 344 KB | Output is correct |
19 | Correct | 1 ms | 348 KB | Output is correct |
20 | Correct | 0 ms | 348 KB | Output is correct |
21 | Correct | 11 ms | 1372 KB | Output is correct |
22 | Correct | 29 ms | 2196 KB | Output is correct |
23 | Correct | 29 ms | 2128 KB | Output is correct |
24 | Correct | 31 ms | 2132 KB | Output is correct |
25 | Correct | 29 ms | 2140 KB | Output is correct |
26 | Correct | 26 ms | 1884 KB | Output is correct |
27 | Correct | 29 ms | 2140 KB | Output is correct |
28 | Correct | 25 ms | 1904 KB | Output is correct |
29 | Correct | 28 ms | 1884 KB | Output is correct |
30 | Correct | 28 ms | 2128 KB | Output is correct |