# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1111171 |
2024-11-11T15:42:14 Z |
huantran |
Autići (COCI22_autici) |
C++17 |
|
11 ms |
1708 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int maxn = 2e5 + 5;
const int oo = 1e9 + 7;
const ll inf = 1e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> a(n);
long long sum = 0;
for (int i = 0; i < n; i++)
cin >> a[i], sum += a[i];
sort(a.begin(), a.end());
cout << sum + (n - 2) * a[0];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
5 ms |
848 KB |
Output is correct |
3 |
Incorrect |
11 ms |
1708 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
5 ms |
848 KB |
Output is correct |
3 |
Incorrect |
11 ms |
1708 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |