#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5;
#define ll long long
ll n, c[nx], res;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>c[i], res+=c[i];
sort(c+1, c+n+1);
reverse(c+1, c+n+1);
for (int i=3; i<=n; i+=3) res-=c[i];
cout<<res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
504 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
10 ms |
1116 KB |
Output is correct |
7 |
Correct |
6 ms |
1116 KB |
Output is correct |
8 |
Correct |
6 ms |
1116 KB |
Output is correct |
9 |
Correct |
12 ms |
1112 KB |
Output is correct |
10 |
Correct |
13 ms |
1112 KB |
Output is correct |