# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
113063 |
2019-05-23T13:42:29 Z |
CaQtiml |
Akcija (COCI15_akcija) |
C++14 |
|
39 ms |
1144 KB |
#include "bits/stdc++.h"
using namespace std;
int arr[(int)1e5+10];
int qs[(int)1e5+10];
int main()
{
int n;
cin >> n;
int rob = n/3;
for(int i=1;i<=n;i++)
{
cin >> arr[i];
qs[i]=qs[i-1]+arr[i];
}
sort(arr+1,arr+1+n);
long long ans=0;
for(int i=1;i<=rob;i++)
{
ans+=arr[((i-1)*3)+1];
//cout << ans << "\n";
}
//for(int i=(3*rob+1);i<=n;i++) ans+=arr[i];
cout << qs[n]-ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
28 ms |
1144 KB |
Output is correct |
7 |
Correct |
25 ms |
1092 KB |
Output is correct |
8 |
Correct |
24 ms |
1144 KB |
Output is correct |
9 |
Incorrect |
37 ms |
1144 KB |
Output isn't correct |
10 |
Incorrect |
39 ms |
1140 KB |
Output isn't correct |