uvaSolutions/uva-11136.cpp at master · BryceShakeAir/uvaSolutions · 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
//uva 11136
//Hoax or what

#include <iostream>
#include <set>

using namespace std;

int main(void)
{
    int n = 0;
    while (true) {
        cin >> n;

        if (n == 0)
            break;

        multiset <int> num;

        long long int totalPrice = 0;


        for (int i = 0; i < n; ++i){
            int k = 0;
            cin >> k;

            for (int j = 0; j < k; ++j){
                int t;
                cin >> t;

                num.insert(t);
            }

            int smallest = *num.begin();
            num.erase(num.begin());

            int biggest = *num.rbegin();
            num.erase(--num.end());

            totalPrice += (biggest - smallest);

        }

        cout << totalPrice << endl;
    }

    return 0;
}