#include <bits/stdc++.h>
using namespace std;
int n, i, sum, v[100005];
int main(){
cin >> n;
for (i=1; i<=n; i++){
cin >> v[i];
}
sort (v, v + n + 1);
for (i=n; i>=1; i--){
sum += v[i];
if (n%3 == 0){
if (i%3 == 1){
sum -= v[i];
}
}
else if (n%3 == 1){
if (i%3 == 2){
sum -= v[i];
}
}
else{
if (i%3 == 0){
sum -= v[i];
}
}
}
cout << sum;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 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 |
256 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
46 ms |
1104 KB |
Output is correct |
7 |
Correct |
42 ms |
1020 KB |
Output is correct |
8 |
Correct |
42 ms |
1144 KB |
Output is correct |
9 |
Correct |
60 ms |
1372 KB |
Output is correct |
10 |
Correct |
61 ms |
1280 KB |
Output is correct |