PAT a1125题解

#include<cstdio>  
#include<stack>  
#include<vector>  
#include<algorithm>  
using namespace std;  
  
int main()  
{  
    int N;  
    scanf("%d", &N);  
    vector<int> v(N,0);  
    for (int i = 0; i < N; i++)  
    {  
        scanf("%d", &v[i]);  
    }  
    sort(v.rbegin(), v.rend());  
    stack<int> s;  
    for (int i = 0; i < N; i++)  
    {  
        s.push(v[i]);  
    }  
    int a, b;  
    while (s.size() > 1)  
    {  
        a = s.top(); s.pop();  
        b = s.top(); s.pop();  
        s.push((a + b) / 2);  
    }  
    printf("%d\n", s.top());  
    return 0;  
}