| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 88570 | aminra | Akcija (COCI15_akcija) | C++14 | 21 ms | 3436 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;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)5e5 + 7;
const int infint = (int)1e9;
const ll inf = (ll)1e18;
int n, a[MAXN];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n);
	ll sm = 0, t = 0;
	for (int i = 0; i < n; i++)
	{
		sm += a[i];
		if(i % 3 == 0 && i + 2 < n)
			t += a[i];
	}
	cout << sm - t;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
