#include <iostream> //#include <queue> using namespace std; int n, suma=0; int sumaNiep=0, niep=0, minNiep=10000; int main(){ ios_base::sync_with_stdio(0); int tmp; //priority_queue<int> q; cin>>n; for (int i=0; i<n; i++){ cin>>tmp; if (tmp%2){ sumaNiep+=tmp; //q.push(tmp); niep++; if (minNiep>tmp){ minNiep=tmp; } }else{ suma+=tmp; } } if (niep%2==0){ cout<<suma+sumaNiep; }else{ if (niep>1){ cout<<suma+sumaNiep-minNiep; }else{ if (suma){ cout<<suma; }else{ cout<<"NIESTETY"; } } } /*if (niep%2==0){ cout<<suma+sumaNiep; }else{ if (niep>1){ while (q.size()>1){ suma+=q.top(); q.pop(); suma+=q.top(); q.pop(); } cout<<suma; }else{ //cout<<suma; if (suma){ cout<<suma; }else{ cout<<"NIESTETY"; } } }*/ 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 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | #include <iostream> //#include <queue> using namespace std; int n, suma=0; int sumaNiep=0, niep=0, minNiep=10000; int main(){ ios_base::sync_with_stdio(0); int tmp; //priority_queue<int> q; cin>>n; for (int i=0; i<n; i++){ cin>>tmp; if (tmp%2){ sumaNiep+=tmp; //q.push(tmp); niep++; if (minNiep>tmp){ minNiep=tmp; } }else{ suma+=tmp; } } if (niep%2==0){ cout<<suma+sumaNiep; }else{ if (niep>1){ cout<<suma+sumaNiep-minNiep; }else{ if (suma){ cout<<suma; }else{ cout<<"NIESTETY"; } } } /*if (niep%2==0){ cout<<suma+sumaNiep; }else{ if (niep>1){ while (q.size()>1){ suma+=q.top(); q.pop(); suma+=q.top(); q.pop(); } cout<<suma; }else{ //cout<<suma; if (suma){ cout<<suma; }else{ cout<<"NIESTETY"; } } }*/ return 0; } |