#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
#define vo vector
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
#define rep(i, a, b) for(ll i=(a); i<(b); i++)
#define repd(i, a, b) for(ll i=(a); i>=(b); i--)
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vo<int> A(n);
rep(i, 0, n)
cin >> A[i];
sort(all(A));
ll ans=0;
while(sz(A)>=3) {
rep(i, 0, 2) {
ans+=A.back();
A.pop_back();
}
A.pop_back();
}
for(auto i: A)
ans+=i;
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
324 KB |
Output is correct |
6 |
Correct |
11 ms |
1100 KB |
Output is correct |
7 |
Correct |
8 ms |
1096 KB |
Output is correct |
8 |
Correct |
8 ms |
1108 KB |
Output is correct |
9 |
Correct |
14 ms |
1236 KB |
Output is correct |
10 |
Correct |
14 ms |
1220 KB |
Output is correct |