Code/bridge.cpp at master · nutmos/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <list>

using namespace std;

int main() {
    int n,tmp;
    scanf("%d",&n);
    list<int> left, right;
    for (int i = 0; i < n; ++i) {
        scanf("%d",&tmp);
        left.push_back(tmp);
    }
    left.sort();
    int timeUse = 0;
    list<int>::iterator it = left.begin();
    timeUse += *(++it);
    right.push_back(*left.begin());
    left.erase(left.begin());
    right.push_back(*left.begin());
    left.erase(left.begin());
    right.sort();
    /*for (list<int>::iterator it = left.begin(); it != left.end(); ++it) {
        printf("%d ",*it);
    }
    printf("\n");*/
    while (left.size() != 2 && left.size() != 3) {
        it = right.begin();
        ++it;
        timeUse += *it;
        left.push_back(*it);
        right.erase(it);
        left.sort();
        it = left.end();
        --it;
        timeUse += *it;
        right.push_back(*it);
        left.erase(it);
        --it;
        right.push_back(*it);
        left.erase(it);
        printf("%d\n",timeUse);
    }
    if (left.size() == 2) {
        timeUse += *right.begin();
        left.push_back(*right.begin());
        right.erase(right.begin());
        left.sort();
        it = left.end();
        --it;
        timeUse += *it;
        left.erase(it);
        --it;
        left.erase(it);
        timeUse += 2 * (*right.begin());
    }
    else if (left.size() == 3) {

    }
    printf("%d\n",timeUse);
}