#include <bits/stdc++.h>
using namespace std;
priority_queue<int> pq;
int main()
{
int n, a;
cin >> n;
for(int i = 1; i <= n; i ++)
cin >> a, pq.push(-a);
while(pq.size() > 1)
{
int x = pq.top();
pq.pop();
int y = pq.top();
pq.pop();
pq.push(-((- x - y) / 2));
}
cout << -pq.top();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |