# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
154252 |
2019-09-19T15:44:36 Z |
Radugnn |
Akcija (COCI15_akcija) |
C++14 |
|
62 ms |
1272 KB |
#include <iostream>
#include <algorithm>
using namespace std;
int v[100010],i,n;
long long s;
int main(){
cin>>n;
for(i=1;i<=n;i++){
cin>>v[i];
s+=v[i];
}
sort(v+1,v+n+1);
for(i=n-2;i>=1;i-=3)
s-=v[i];
cout<<s;
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 |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
45 ms |
1144 KB |
Output is correct |
7 |
Correct |
41 ms |
1148 KB |
Output is correct |
8 |
Correct |
42 ms |
1144 KB |
Output is correct |
9 |
Correct |
62 ms |
1272 KB |
Output is correct |
10 |
Correct |
60 ms |
1272 KB |
Output is correct |