//Przemysław Jakub Kozłowski #include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int INF = 1000000009; int n; int main() { scanf("%d", &n); int suma = 0, minnp = INF; for(int i = 1;i <= n;i++) { int a; scanf("%d", &a); suma += a; if(a%2 == 1) minnp = min(minnp, a); } if(suma%2 == 0) printf("%d\n", suma); else if(suma-minnp > 0) printf("%d\n", suma-minnp); else printf("NIESTETY\n"); 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 | //Przemysław Jakub Kozłowski #include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int INF = 1000000009; int n; int main() { scanf("%d", &n); int suma = 0, minnp = INF; for(int i = 1;i <= n;i++) { int a; scanf("%d", &a); suma += a; if(a%2 == 1) minnp = min(minnp, a); } if(suma%2 == 0) printf("%d\n", suma); else if(suma-minnp > 0) printf("%d\n", suma-minnp); else printf("NIESTETY\n"); return 0; } |