0分求条

#include <bits/stdc++.h>
using namespace std;

priority_queue<int> q;
queue<int> ans;
int n;

int main(){
	cin >> n;
	int y;
	for(int i=1; i<=n; i++){
		int num;
		cin >> num;
		q.push(num);
		if(i % 2 == 1) ans.push(num);
	}
	while(ans.size()){
		cout << ans.front() << endl;
		ans.pop();
	}
	return 0;
}