oj.uz

Submission #103509

# Submission time Handle Problem Language Result Execution time Memory
103509 2019-03-30T20:45:31 Z leonarda Akcija (COCI15_akcija) C++14
80 / 80
 30 ms 1664 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define first ff
#define second ss
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
lint n;
lint a[maxn];
lint mini;

bool komp(int t1, int t2) {
	return t1 > t2;
}

int main ()
{
	ios::sync_with_stdio(0);
	
	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> a[i];
		
	sort(a, a + n, komp);
	
//	for(int i = 0; i < n; ++i)
//		cout << a[i] << " ";
	
	for(int i = 0; i < n; i += 3) {
		mini += a[i] + a[i + 1];
	}
	cout << mini;
	
return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 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 25 ms 1536 KB Output is correct
7 Correct 16 ms 1536 KB Output is correct
8 Correct 14 ms 1536 KB Output is correct
9 Correct 30 ms 1656 KB Output is correct
10 Correct 30 ms 1664 KB Output is correct