题解

#include<bits/stdc++.h>
using namespace std;
int main(){
    priority_queue<int,vector<int>,less<int>>q;
    int n;
    cin>>n;
    for(int i = 1;i <= n;i++){
        int x;
        cin>>x;
        q.push(x);
    }
    cout<<q.top();
    return 0;
}

用优先队列自动排好，然后输出第一项