# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1076854 | toast12 | Akcija (COCI15_akcija) | C++14 | 23 ms | 1392 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<int> nums(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
ans += nums[i];
}
sort(nums.begin(), nums.end());
reverse(nums.begin(), nums.end());
for (int i = 0; i < n; i++) {
if (i % 3 == 2)
ans -= nums[i];
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |