蒟蒻求助qwq

#include<bits/stdc++.h>
using namespace std;
struct b22
{
	int num,p;
	bool operator < (const b22& x) const
	{
		return num<x.num;
	}
};
int main()
{
	int n;
	cin>>n;
	int ball[n+5],last=n;
	priority_queue<b22> q;
	bool out[n+5];
	memset(out,false,sizeof(out));
	for(int i=1;i<=n;i++)
	{
		cin>>ball[i];
		q.push(b22{ball[i],i});
	}
	while(!q.empty()&&last>0)
	{
		int np=q.top().p;
		q.pop();
		if(out[np]||np>=last)
			continue;
		for(int i=np+1;i<=n;i++)
			if(!out[i])
			{
				cout<<ball[np]<<' '<<ball[np+1]<<' ';
				break;
			}
		out[np]=out[np+1]=true;
		if(np+1==last)
			last-=2;
	}
	return 0;
}