#include <cstdio> #include <algorithm> using namespace std; int n; int a[1000001]; int new_n = 0; int new_a[1000001]; long long sum = 0; int main() { int i; int new_i = 0; scanf("%d", &n); for (i=0; i<n; i++) { scanf("%d", &a[i]); if (a[i] % 2 == 0) { sum += a[i]; } else { new_a[new_i++] = a[i]; } } new_n = new_i; /* sort new_a */ sort(new_a, new_a + new_n); /* check number even of new_n */ if (new_n % 2 == 0) { i = 0; } else { i = 1; } for (; i<new_n; i++) { sum += new_a[i]; } if (sum > 0) printf("%lld\n", sum); else printf("NIESTETY\n"); }
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 | #include <cstdio> #include <algorithm> using namespace std; int n; int a[1000001]; int new_n = 0; int new_a[1000001]; long long sum = 0; int main() { int i; int new_i = 0; scanf("%d", &n); for (i=0; i<n; i++) { scanf("%d", &a[i]); if (a[i] % 2 == 0) { sum += a[i]; } else { new_a[new_i++] = a[i]; } } new_n = new_i; /* sort new_a */ sort(new_a, new_a + new_n); /* check number even of new_n */ if (new_n % 2 == 0) { i = 0; } else { i = 1; } for (; i<new_n; i++) { sum += new_a[i]; } if (sum > 0) printf("%lld\n", sum); else printf("NIESTETY\n"); } |