| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 737679 |
2023-05-07T14:09:48 Z |
a_aguilo |
Autići (COCI22_autici) |
C++14 |
|
47 ms |
692 KB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>V(n);
for(int i = 0; i < n; ++i) cin >> V[i];
sort(V.begin(), V.end());
long long int ans = 0;
ans += (long long)V[0]*(n-1);
for(int i = 1; i < n; ++i) ans += (long long)V[i];
cout << ans << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
16 ms |
596 KB |
Output is correct |
| 3 |
Correct |
37 ms |
596 KB |
Output is correct |
| 4 |
Correct |
34 ms |
664 KB |
Output is correct |
| 5 |
Correct |
40 ms |
596 KB |
Output is correct |
| 6 |
Correct |
31 ms |
672 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
16 ms |
596 KB |
Output is correct |
| 3 |
Correct |
37 ms |
596 KB |
Output is correct |
| 4 |
Correct |
34 ms |
664 KB |
Output is correct |
| 5 |
Correct |
40 ms |
596 KB |
Output is correct |
| 6 |
Correct |
31 ms |
672 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
1 ms |
212 KB |
Output is correct |
| 21 |
Correct |
14 ms |
676 KB |
Output is correct |
| 22 |
Correct |
39 ms |
596 KB |
Output is correct |
| 23 |
Correct |
42 ms |
596 KB |
Output is correct |
| 24 |
Correct |
47 ms |
596 KB |
Output is correct |
| 25 |
Correct |
43 ms |
596 KB |
Output is correct |
| 26 |
Correct |
39 ms |
596 KB |
Output is correct |
| 27 |
Correct |
41 ms |
692 KB |
Output is correct |
| 28 |
Correct |
40 ms |
636 KB |
Output is correct |
| 29 |
Correct |
42 ms |
596 KB |
Output is correct |
| 30 |
Correct |
37 ms |
596 KB |
Output is correct |
