#include <bits/stdc++.h>
using namespace std;
priority_queue<int> p;
priority_queue<int,vector<int>,greater<int> > q;
int m,n,a[100007],u[100007];
int main()
{
	cin >> m >> n;
	for (int i = 1;i <= m;i++)
	{
		cin >> a[i];
	}
	for (int i = 1;i <= n;i++)
	{
		cin >> u[i];
	}
	int j = 1;
	for (int i = 1;i <= n;i++)
	{
		while(j<=u[i])
		{
			p.push(a[j]);
			j++;
			q.push(p.top());
			p.pop();
		}
		p.push(q.top());
		q.pop();
		cout << p.top() << endl;
	}
	return 0;
}

AC满分代码，求点赞！！！！！！ http://oj.hetao101.com/d/extra_training/p/P1053/solution/65d88cdebe73cc1b3225c469