#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 100000;
int a[N+5];
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
ll res = 0;
for(int i=1; i<=n; i++) cin >> a[i], res += a[i];
sort(a+1, a+1+n);
reverse(a+1, a+1+n);
for(int i=3; i<=n; i+=3) res -= a[i];
cout << res << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
18 ms |
1088 KB |
Output is correct |
7 |
Correct |
10 ms |
1100 KB |
Output is correct |
8 |
Correct |
10 ms |
1048 KB |
Output is correct |
9 |
Correct |
19 ms |
1268 KB |
Output is correct |
10 |
Correct |
18 ms |
1188 KB |
Output is correct |