# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
838654 |
2023-08-27T14:13:26 Z |
vjudge1 |
Akcija (COCI15_akcija) |
C++17 |
|
13 ms |
1660 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY 1000000005
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mid (start+end)/2
int32_t main(){
faster
int n;cin>>n;
int dizi[n];
for(int i=0;i<n;i++)cin>>dizi[i];
sort(dizi,dizi+n);
int cev=0;
for(int i=0;i<n;i++){
if(i%3==0)continue;
cev+=dizi[i];
}
cout<<cev<<'\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
324 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
10 ms |
1488 KB |
Output is correct |
7 |
Correct |
7 ms |
1472 KB |
Output is correct |
8 |
Incorrect |
6 ms |
1492 KB |
Output isn't correct |
9 |
Incorrect |
13 ms |
1660 KB |
Output isn't correct |
10 |
Incorrect |
13 ms |
1652 KB |
Output isn't correct |