Submission #208283

#	Time	Username	Problem	Language	Result	Execution time	Memory
208283		Neklixx	Akcija (COCI15_akcija)	C++14	80 / 80	25 ms	1532 KiB

akcija

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define sh cin.tie(0); cin.sync_with_stdio(0); cout.tie(0);
#define FILE freopen("test.in", "r", stdin);
#define vprint(v) for (int ii = 0; ii < v.size(); ii++){cout << v[ii] << " ";}
#define debugv(v) if (v.size() != 0) {cout << "[ "; for (int __ = 0; __ < (int)(v.size()) - 1; __++){cout << v[__] << ", ";} cout << v[(int)(v.size()) - 1] << " ]" << endl;} else {cout << "[]" << endl;}
#define debug cout << "-----------------------------------------------" << endl;
#define print1(a) cout << "{ " << a << " }" << endl;
#define print2(a, b) cout << "{ " << a << ", " << b << " }" << endl;
#define print3(a, b, c) cout << "{ " << a << ", " << b << ", " << c << " }" << endl;
#define print4(a, b, c, d) cout << "{ " << a << ", " << b << ", " << c << ", " << d << " }" << endl;
using namespace std;
//#define int long long
const int INF = 1e9 + 228;
const int MAXN = 1e5 + 228;

signed main()
{
#ifdef LOCAL
    FILE;
#endif
    sh;
	int n;
	cin >> n;
	vector<int> v;
	int ans = 0;
	for (int i = 0; i < n; i++) {
		int aa;
		cin >> aa;
		ans += aa;
		v.pb(aa);
	}
	sort(all(v));
	reverse(all(v));
	for (int i = 0; i + 2 < n; i += 3) {
		ans -= v[i + 2];
	}    
	cout << ans << endl;
    return 0;

}

• Subtask 1: 80 / 80