0分 看了题解 怎么看都感觉思路差不多 问deepseek和chatgpt都说没问题 有佬给孩子看看吗

#include<iostream>
#include<queue>
using namespace std;
vector<long long >a;
priority_queue<long long ,vector<long long>,less<long long>>b;
priority_queue<long long ,vector<long long>,greater<long long>>s;
int main(){
    long long n;cin>>n;a.resize(n);
    for(int i=0;i<n;i++) cin>>a[i];
    // cout<<"yes1"<<endl;
    s.push(a[0]);
    // cout<<"yes2"<<endl;
    cout<<s.top()<<endl;
    // if(n%2==0)n-=1;
    for(int i=1;i<n;i+=2){
        // if(i+1>=n) break;
        long long k=s.top();
        long long k1=min(a[i],a[i+1]);
        long long k2=max(a[i],a[i+1]);
        if(k1>=k){
            s.push(k1);
            s.push(k2);
            b.push(k);
            s.pop();
        }else{
            if(k2<=k){
                s.push(k2);
                b.push(k1);
            }else{
                b.push(k1);
                s.push(k2);
            }
        }
        cout<<s.top()<<endl;
    }
    return 0;
}