#include <cstdio> #include <queue> using namespace std; int main() { int n; scanf("%d", &n); priority_queue<int> qu; for(int i = 0; i < n; ++i) { int a; scanf("%d", &a); qu.push(-a); } while(qu.size() > 1) { int a, b; a = qu.top(); qu.pop(); b = qu.top(); if(a != b) { continue; } qu.pop(); qu.push(a-1); } printf("%d\n", -qu.top()); 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 | #include <cstdio> #include <queue> using namespace std; int main() { int n; scanf("%d", &n); priority_queue<int> qu; for(int i = 0; i < n; ++i) { int a; scanf("%d", &a); qu.push(-a); } while(qu.size() > 1) { int a, b; a = qu.top(); qu.pop(); b = qu.top(); if(a != b) { continue; } qu.pop(); qu.push(a-1); } printf("%d\n", -qu.top()); return 0; } |