#include <cstdio> #include <vector> #include <algorithm> using namespace std; int n,a,wyn,in; vector<int> tab; vector<int> np; int main() { scanf("%d", &n); for(int i=0;i<n;i++) { scanf("%d", &a); wyn+=a; if(a%2!=0)np.push_back(a); } sort(np.begin(),np.end()); while(wyn%2!=0 && in<n){ wyn-=np[in]; in++; } if(in>=n || wyn==0)printf("NIESTETY"); else printf("%d", 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 | #include <cstdio> #include <vector> #include <algorithm> using namespace std; int n,a,wyn,in; vector<int> tab; vector<int> np; int main() { scanf("%d", &n); for(int i=0;i<n;i++) { scanf("%d", &a); wyn+=a; if(a%2!=0)np.push_back(a); } sort(np.begin(),np.end()); while(wyn%2!=0 && in<n){ wyn-=np[in]; in++; } if(in>=n || wyn==0)printf("NIESTETY"); else printf("%d", wyn); return 0; } |