#include <iostream>
#include <algorithm>
using namespace std;
//ifstream cin("karte.in");
//ofstream cout("karte.out");
int n,i,j,v[100010];
long long total;
int main()
{
cin>>n;
for(i=1;i<=n;i++){
cin>>v[i];
total+=v[i];
}
sort(v+1,v+n+1);
for(i=n-2;i>=1;i-=3)
total-=v[i];
cout<<total;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
3 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
252 KB |
Output is correct |
6 |
Correct |
44 ms |
1016 KB |
Output is correct |
7 |
Correct |
40 ms |
1176 KB |
Output is correct |
8 |
Correct |
44 ms |
1144 KB |
Output is correct |
9 |
Correct |
58 ms |
1272 KB |
Output is correct |
10 |
Correct |
58 ms |
1400 KB |
Output is correct |