| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 610864 |
2022-07-28T16:30:55 Z |
ak2006 |
Autići (COCI22_autici) |
C++14 |
|
52 ms |
2136 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long sum = 0;
vector<long long>d(n + 1);
for (int i = 1;i<=n;i++)cin>>d[i];
sort(d.begin() + 1,d.end());
for (int i = 2;i<=n;i++)
sum += d[i] + d[1];
cout<<sum;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
14 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
41 ms |
1996 KB |
Output is correct |
| 4 |
Correct |
52 ms |
1808 KB |
Output is correct |
| 5 |
Correct |
40 ms |
1984 KB |
Output is correct |
| 6 |
Correct |
32 ms |
1832 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
312 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 |
312 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 |
14 ms |
1212 KB |
Output is correct |
| 3 |
Correct |
41 ms |
1996 KB |
Output is correct |
| 4 |
Correct |
52 ms |
1808 KB |
Output is correct |
| 5 |
Correct |
40 ms |
1984 KB |
Output is correct |
| 6 |
Correct |
32 ms |
1832 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 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 |
312 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 |
312 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 |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
300 KB |
Output is correct |
| 21 |
Correct |
15 ms |
1240 KB |
Output is correct |
| 22 |
Correct |
38 ms |
2048 KB |
Output is correct |
| 23 |
Correct |
37 ms |
2048 KB |
Output is correct |
| 24 |
Correct |
41 ms |
1908 KB |
Output is correct |
| 25 |
Correct |
46 ms |
2136 KB |
Output is correct |
| 26 |
Correct |
41 ms |
1840 KB |
Output is correct |
| 27 |
Correct |
44 ms |
1952 KB |
Output is correct |
| 28 |
Correct |
45 ms |
1764 KB |
Output is correct |
| 29 |
Correct |
43 ms |
1948 KB |
Output is correct |
| 30 |
Correct |
37 ms |
1904 KB |
Output is correct |
