oj.uz

Submission #154344

# Submission time Handle Problem Language Result Execution time Memory
154344 2019-09-20T21:23:41 Z jvalsortav Akcija (COCI15_akcija) C++14
80 / 80
 59 ms 1524 KB 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <map>
#define ll long long

using namespace std;

const int M = 1000000007;

int n, c, s, x;
vector <int> v;

int main() {

	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	
	cin >> n;
	
	for (int i = 0; i < n; i++){
		cin >> x; s += x;
		v.push_back(x);
	}
	c = n-3;
	sort(v.begin(), v.end());
	for (int i = c; i >= 0; i -= 3){
		s -= v[i];
	}
	
	cout << s;
return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 45 ms 1268 KB Output is correct
7 Correct 44 ms 1396 KB Output is correct
8 Correct 41 ms 1396 KB Output is correct
9 Correct 59 ms 1396 KB Output is correct
10 Correct 59 ms 1524 KB Output is correct