#include <bits/stdc++.h> using namespace std; int n; int x; vector <int> wek; int wyn; int main() { scanf("%d", &n); while(n--) { scanf("%d", &x); if (x&1) wek.push_back(x); else wyn+=x; } for (int i=1; i<wek.size(); i++) { if (wek[i]<wek[0]) { swap(wek[i], wek[0]); } } while(wek.size()>1) { wyn+=wek.back(); wek.pop_back(); wyn+=wek.back(); wek.pop_back(); } if (!wyn) printf("NIESTETY\n"); else printf("%d\n", wyn); return 0; }
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 | #include <bits/stdc++.h> using namespace std; int n; int x; vector <int> wek; int wyn; int main() { scanf("%d", &n); while(n--) { scanf("%d", &x); if (x&1) wek.push_back(x); else wyn+=x; } for (int i=1; i<wek.size(); i++) { if (wek[i]<wek[0]) { swap(wek[i], wek[0]); } } while(wek.size()>1) { wyn+=wek.back(); wek.pop_back(); wyn+=wek.back(); wek.pop_back(); } if (!wyn) printf("NIESTETY\n"); else printf("%d\n", wyn); return 0; } |