# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
104662 |
2019-04-08T15:17:38 Z |
MatesV13 |
Akcija (COCI15_akcija) |
C++11 |
|
20 ms |
1280 KB |
#include <bits/stdc++.h>
using namespace std;
int n, c[100055];
long long sum, freebook;
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i=0;i<n;i++){
cin >> c[i];
sum += c[i];
}
sort (c, c+n);
for (int i=n-3;i>=0;i-=3){
freebook += c[i];
}
cout << sum - freebook;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
3 ms |
384 KB |
Output is correct |
5 |
Correct |
3 ms |
384 KB |
Output is correct |
6 |
Correct |
15 ms |
1276 KB |
Output is correct |
7 |
Correct |
13 ms |
1152 KB |
Output is correct |
8 |
Correct |
15 ms |
1172 KB |
Output is correct |
9 |
Correct |
20 ms |
1280 KB |
Output is correct |
10 |
Correct |
20 ms |
1280 KB |
Output is correct |