#include <iostream>
#include <algorithm>
using namespace std;
int v[100008],i,n;
long long sum;
int main()
{
cin>>n;
for(i=1;i<=n;i++){
cin>>v[i];
}
sort(v+1,v+n+1);
if(n%3==1){
sum+=v[1];
}
if(n%3==2){
sum+=v[1]+v[2];
}
for(i=n;i>=3;i-=3){
sum+=v[i]+v[i-1];
}
cout<<sum;
}
# |
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 |
256 KB |
Output is correct |
5 |
Correct |
3 ms |
380 KB |
Output is correct |
6 |
Correct |
45 ms |
1144 KB |
Output is correct |
7 |
Correct |
41 ms |
1132 KB |
Output is correct |
8 |
Correct |
41 ms |
1064 KB |
Output is correct |
9 |
Correct |
59 ms |
1276 KB |
Output is correct |
10 |
Correct |
59 ms |
1272 KB |
Output is correct |