#include <iostream>
#include <algorithm>
using namespace std;
int n,i,v[100001];
long long sum;
int main(){
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i],sum+=v[i];
sort(v+1,v+n+1);
for(i=n-2;i>0;i-=3)
sum-=v[i];
cout<<sum;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
45 ms |
1016 KB |
Output is correct |
7 |
Correct |
41 ms |
1020 KB |
Output is correct |
8 |
Correct |
41 ms |
1016 KB |
Output is correct |
9 |
Correct |
60 ms |
1016 KB |
Output is correct |
10 |
Correct |
60 ms |
1016 KB |
Output is correct |