#include <cstdio> #include <queue> using namespace std; int main() { int n, k; long long sum = 0; priority_queue<int> Q; scanf("%d", &n); while (n--) { scanf("%d", &k); if (k % 2 == 0) sum += k; else Q.push(k); } while (Q.size() > 1) { sum += Q.top(); Q.pop(); sum += Q.top(); Q.pop(); } if (sum == 0)printf("NIESTETY"); else printf("%lld", sum); 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 <queue> using namespace std; int main() { int n, k; long long sum = 0; priority_queue<int> Q; scanf("%d", &n); while (n--) { scanf("%d", &k); if (k % 2 == 0) sum += k; else Q.push(k); } while (Q.size() > 1) { sum += Q.top(); Q.pop(); sum += Q.top(); Q.pop(); } if (sum == 0)printf("NIESTETY"); else printf("%lld", sum); return 0; } |