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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void printArray(vector<int>& arr);

//SIANO

int main() {

	ios_base::sync_with_stdio(0);

	int motherMoney = 0,
	    denom = 0,
	    result = 0,
	    lastUsedOddNum = 0;

	cin >> motherMoney;

	vector<int> denomArr;
	vector<bool> isUsedArr;
	for (int i = 0; i < motherMoney; ++i) {
		cin >> denom;
		denomArr.push_back(denom);
		isUsedArr.push_back(false);
	}
	sort(denomArr.begin(), denomArr.end(), greater<int>());

	for (int i = 0; i < motherMoney; ++i) {
		if (denomArr[i] % 2 == 0)
			result += denomArr[i];
		else if (!isUsedArr[i]) {
			lastUsedOddNum = (lastUsedOddNum <= i) ? i + 1 : lastUsedOddNum + 1;
			while (lastUsedOddNum < motherMoney) {

				if (denomArr[lastUsedOddNum] % 2 == 1) {
					isUsedArr[lastUsedOddNum] = true;
					result += denomArr[i] + denomArr[lastUsedOddNum];
					break;
				}
				++lastUsedOddNum;
			}

		}
	}

	if (result)
		cout << result << endl;
	else
		cout << "NIESTETY" << endl;

	return 0;
}

void printArray(vector<int>& arr) {
	cout << endl;
	for (int i = 0; i < arr.size(); ++i) {
		cout << arr[i] << ", ";
	}
	cout << endl;
}