# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
156128 |
2019-10-03T14:57:56 Z |
mdn2002 |
Akcija (COCI15_akcija) |
C++14 |
|
85 ms |
804 KB |
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
int n,a[100005],ans=0,k=0;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=n-1;i>=0;i--)
{
k++;
if(k==3)
{
k=0;
continue;
}
ans+=a[i];
}
cout<<ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
452 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
47 ms |
772 KB |
Output is correct |
7 |
Correct |
42 ms |
636 KB |
Output is correct |
8 |
Correct |
42 ms |
752 KB |
Output is correct |
9 |
Correct |
85 ms |
760 KB |
Output is correct |
10 |
Correct |
61 ms |
804 KB |
Output is correct |