# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
528239 | 2022-02-19T18:09:03 Z | rainboy | Autići (COCI22_autici) | C | 14 ms | 1148 KB |
#include <stdio.h> #define INF 0x3f3f3f3f int min(int a, int b) { return a < b ? a : b; } int main() { int n, mn, i; long long sum; scanf("%d", &n); sum = 0, mn = INF; for (i = 0; i < n; i++) { int a; scanf("%d", &a); sum += a; mn = min(mn, a); } printf("%lld\n", sum + (long long) mn * (n - 2)); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 7 ms | 204 KB | Output is correct |
3 | Correct | 13 ms | 1148 KB | Output is correct |
4 | Correct | 12 ms | 964 KB | Output is correct |
5 | Correct | 13 ms | 564 KB | Output is correct |
6 | Correct | 11 ms | 492 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 276 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 272 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 204 KB | Output is correct |
11 | Correct | 0 ms | 204 KB | Output is correct |
12 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 7 ms | 204 KB | Output is correct |
3 | Correct | 13 ms | 1148 KB | Output is correct |
4 | Correct | 12 ms | 964 KB | Output is correct |
5 | Correct | 13 ms | 564 KB | Output is correct |
6 | Correct | 11 ms | 492 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 1 ms | 276 KB | Output is correct |
11 | Correct | 0 ms | 204 KB | Output is correct |
12 | Correct | 0 ms | 272 KB | Output is correct |
13 | Correct | 1 ms | 204 KB | Output is correct |
14 | Correct | 0 ms | 204 KB | Output is correct |
15 | Correct | 0 ms | 204 KB | Output is correct |
16 | Correct | 1 ms | 204 KB | Output is correct |
17 | Correct | 0 ms | 204 KB | Output is correct |
18 | Correct | 0 ms | 204 KB | Output is correct |
19 | Correct | 0 ms | 276 KB | Output is correct |
20 | Correct | 0 ms | 204 KB | Output is correct |
21 | Correct | 8 ms | 328 KB | Output is correct |
22 | Correct | 12 ms | 276 KB | Output is correct |
23 | Correct | 12 ms | 416 KB | Output is correct |
24 | Correct | 12 ms | 272 KB | Output is correct |
25 | Correct | 13 ms | 204 KB | Output is correct |
26 | Correct | 12 ms | 288 KB | Output is correct |
27 | Correct | 13 ms | 272 KB | Output is correct |
28 | Correct | 13 ms | 1012 KB | Output is correct |
29 | Correct | 14 ms | 1124 KB | Output is correct |
30 | Correct | 12 ms | 824 KB | Output is correct |