# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81634 | xiaowuc1 | Akcija (COCI15_akcija) | C++14 | 32 ms | 3512 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>
/*
unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count();
mt19937 g1.seed(seed1);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
*/
using namespace std;
const double PI = 2 * acos(0);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, ll> pill;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<vector<ll>> matrix;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
for(int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
v.push_back(t);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
ll ret = 0;
for(int i = 0; i < n; i++) {
if(i%3==2) continue;
ret += v[i];
}
printf("%lld\n", ret);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |