#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n, c[100002], x = 0;
cin >> n;
for(long long i = 0; i < n; ++i) cin >> c[i];
sort(c, c + n);
for(long long i = n - 1; i >= 2; i -= 3) x += c[i] + c[i - 1];
if(n % 3 == 2) x += c[0] + c[1];
else if(n % 3) x += c[0];
cout << x;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
380 KB |
Output is correct |
6 |
Correct |
16 ms |
1528 KB |
Output is correct |
7 |
Correct |
10 ms |
1528 KB |
Output is correct |
8 |
Correct |
10 ms |
1528 KB |
Output is correct |
9 |
Correct |
17 ms |
1656 KB |
Output is correct |
10 |
Correct |
17 ms |
1656 KB |
Output is correct |