| Task: | Card game |
| Sender: | Häviö Life |
| Submission time: | 2015-09-09 17:00:38 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | UNKNOWN | -- | details |
| #2 | UNKNOWN | -- | details |
| #3 | UNKNOWN | -- | details |
| #4 | UNKNOWN | -- | details |
| #5 | UNKNOWN | -- | details |
| #6 | UNKNOWN | -- | details |
| #7 | UNKNOWN | -- | details |
| #8 | UNKNOWN | -- | details |
| #9 | UNKNOWN | -- | details |
| #10 | UNKNOWN | -- | details |
| #11 | UNKNOWN | -- | details |
| #12 | UNKNOWN | -- | details |
| #13 | UNKNOWN | -- | details |
| #14 | UNKNOWN | -- | details |
| #15 | UNKNOWN | -- | details |
| #16 | UNKNOWN | -- | details |
| #17 | UNKNOWN | -- | details |
| #18 | UNKNOWN | -- | details |
Code
#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>
#define MOD 1000000007
#define ll long long
#define N (1<<17)
#define float double
using namespace std;
ll m[100000];
int main(){
int n;
cin>>n;
for(int i=0; i<n; i++)
cin>>m[i];
sort(m,m+n);
ll tulos=0;
for(int i=n-1; i>1; i-=3)
tulos+=m[i-1]+m[i-2];
cout<<tulos<<endl;
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) |