# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
791127 | 2023-07-23T12:41:56 Z | Username4132 | Autići (COCI22_autici) | C++14 | 10 ms | 1308 KB |
#include<iostream> using namespace std; using ll = long long; #define forn(i, n) for(int i=0; i<(int)n; ++i) int a, n, mn=1000000010; ll s; int main(){ scanf("%d", &n); forn(i, n){ scanf("%d", &a); s+=a; mn = min(mn, a); } printf("%lld\n", s + ((n-2)*((ll)mn))); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 6 ms | 468 KB | Output is correct |
3 | Correct | 8 ms | 1236 KB | Output is correct |
4 | Correct | 8 ms | 1056 KB | Output is correct |
5 | Correct | 8 ms | 1176 KB | Output is correct |
6 | Correct | 10 ms | 1180 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 304 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 304 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 6 ms | 468 KB | Output is correct |
3 | Correct | 8 ms | 1236 KB | Output is correct |
4 | Correct | 8 ms | 1056 KB | Output is correct |
5 | Correct | 8 ms | 1176 KB | Output is correct |
6 | Correct | 10 ms | 1180 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 304 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 304 KB | Output is correct |
15 | Correct | 0 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 212 KB | Output is correct |
17 | Correct | 0 ms | 212 KB | Output is correct |
18 | Correct | 0 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 300 KB | Output is correct |
20 | Correct | 1 ms | 212 KB | Output is correct |
21 | Correct | 6 ms | 408 KB | Output is correct |
22 | Correct | 8 ms | 1308 KB | Output is correct |
23 | Correct | 8 ms | 1176 KB | Output is correct |
24 | Correct | 8 ms | 1108 KB | Output is correct |
25 | Correct | 8 ms | 1236 KB | Output is correct |
26 | Correct | 8 ms | 1108 KB | Output is correct |
27 | Correct | 9 ms | 1172 KB | Output is correct |
28 | Correct | 8 ms | 1076 KB | Output is correct |
29 | Correct | 8 ms | 1180 KB | Output is correct |
30 | Correct | 8 ms | 1236 KB | Output is correct |