P4387 【深基15.习9】验证栈序列

答案哪里错了

#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<stack>
using namespace std;
int n,q,pushed[100010],top=1,y;
stack<int> poped;
bool cnt;
int main()
{
	cin>>q;
	while(q--)
	{
		cnt=true;
		cin>>n;
		for(int i=1; i<=n; i++)
		{
			cin>>pushed[i];
		}
		for(int i=1; i<=n; i++)
		{
			cin>>y;
			poped.push(y);
		}
		for(int i=1; i<=n; i++)
		{
			if(poped.top()<pushed[top]&&poped.top()!=' ')
			{
				cout<<"No"<<endl;
				cnt=false;
				break;
			}
			else
			{
				top=poped.top();
			}
			poped.pop();
		}
		if(cnt)
		{
			cout<<"Yes";
		}
	}
	return 0;
}