#include <iostream>
#include <algorithm>
using namespace std;
int n,i,j;
int v[100010];
int main (){
cin>>n;
for (i=1;i<=n;i++)
cin>>v[i];
sort (v+1,v+n+1);
long long sol = 0;
for (i=n;i>=1;i-=3)
sol += v[i]+v[i-1];
cout<<sol;
return 0;
}
# |
Verdict |
Execution time |
Memory |
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 |
380 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
45 ms |
632 KB |
Output is correct |
7 |
Correct |
41 ms |
760 KB |
Output is correct |
8 |
Correct |
41 ms |
632 KB |
Output is correct |
9 |
Correct |
62 ms |
760 KB |
Output is correct |
10 |
Correct |
60 ms |
760 KB |
Output is correct |