#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);
ll n;
cin >> n;
vo<ll> A(n);
rep(i, 0, n)
cin >> A[i];
sort(all(A)); ll ans=0;
while(sz(A)>=3) {
ans+=A.back();
A.pop_back();
ans+=A.back();
A.pop_back();
A.pop_back();
}
for(auto i: A)
ans+=i;
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
308 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
12 ms |
1476 KB |
Output is correct |
7 |
Correct |
8 ms |
1476 KB |
Output is correct |
8 |
Correct |
7 ms |
1468 KB |
Output is correct |
9 |
Correct |
17 ms |
1584 KB |
Output is correct |
10 |
Correct |
15 ms |
1592 KB |
Output is correct |