Submission details
Task:Card game
Sender: >--) ) ) )*>
Submission time:2015-09-09 16:46:55 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1UNKNOWN--details
#2UNKNOWN--details
#3UNKNOWN--details
#4UNKNOWN--details
#5UNKNOWN--details
#6UNKNOWN--details
#7UNKNOWN--details
#8UNKNOWN--details
#9UNKNOWN--details
#10UNKNOWN--details
#11UNKNOWN--details
#12UNKNOWN--details
#13UNKNOWN--details
#14UNKNOWN--details
#15UNKNOWN--details
#16UNKNOWN--details
#17UNKNOWN--details
#18UNKNOWN--details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:65:7: warning: unused variable 'x' [-Wunused-variable]
   int x = c.back();
       ^

Code

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

#define ll long long
#define ld long double
#define ii pair<int,int>
#define si pair<string,int>
#define iii pair<int,ii>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define msvs map<string,vs>
#define msi map<string,int>
#define mss map<string,int>
#define us unordered_set
#define um unordered_map
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define forall(i,a,b) for (int i=a;i<b;i++)
#define foreach(v,c) for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define N (1<<17)
#define M 1000000007
#define I 500000004

int n;
vi c;

int main()
{
	cin.sync_with_stdio(false);
	cin >> n;
	for (int i = 0; i < n; i++) {
		int t; cin >> t;
		c.pb(t);
	}
	sort(all(c));
	ll s = 0;
	while (c.size() >= 3) {
		int x = c.back();
		c.pop_back();
		int y = c.back();
		c.pop_back();
		int z = c.back();
		c.pop_back();
		s += y+z;
	}
	cout << s << "\n";
	return 0;
}

Test details

Test 1

Verdict: UNKNOWN

input
6
2 1 5 3 4 3

correct output
10

user output
(not available)

Test 2

Verdict: UNKNOWN

input
5
1 2 5 4 3

correct output
7

user output
(not available)

Test 3

Verdict: UNKNOWN

input
27014
45 16 2 61 31 41 37 46 44 21 4...

correct output
582478

user output
(not available)

Test 4

Verdict: UNKNOWN

input
64473
11 6 3 7 9 4 1 11 13 11 2 10 6...

correct output
300696

user output
(not available)

Test 5

Verdict: UNKNOWN

input
64336
509145 587269 302927 583880 50...

correct output
21522871494

user output
(not available)

Test 6

Verdict: UNKNOWN

input
30336
557855 345472 141504 110157 11...

correct output
10130887318

user output
(not available)

Test 7

Verdict: UNKNOWN

input
4373
520104 402147 137925 983880 75...

correct output
1454728921

user output
(not available)

Test 8

Verdict: UNKNOWN

input
21999
144634 234821 827342 831785 88...

correct output
7319664049

user output
(not available)

Test 9

Verdict: UNKNOWN

input
100000
27571 375948 483033 881820 680...

correct output
33288800620

user output
(not available)

Test 10

Verdict: UNKNOWN

input
100000
57034 65824 99995 99996 74998 ...

correct output
3333333333

user output
(not available)

Test 11

Verdict: UNKNOWN

input
3
1 1 1

correct output
2

user output
(not available)

Test 12

Verdict: UNKNOWN

input
3
1 1 2

correct output
2

user output
(not available)

Test 13

Verdict: UNKNOWN

input
100000
1000000 1000000 1000000 100000...

correct output
66666000000

user output
(not available)

Test 14

Verdict: UNKNOWN

input
3
1 2 1

correct output
2

user output
(not available)

Test 15

Verdict: UNKNOWN

input
3
2 1 1

correct output
2

user output
(not available)

Test 16

Verdict: UNKNOWN

input
3
2 2 1

correct output
3

user output
(not available)

Test 17

Verdict: UNKNOWN

input
3
2 1 2

correct output
3

user output
(not available)

Test 18

Verdict: UNKNOWN

input
3
1 2 2

correct output
3

user output
(not available)