用栈模拟..
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
int main()
{
int n,a,b,ans=0;
scanf("%d",&n);
stack<int> q;
for(int i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
if(b) q.push(a);
else
{
if(q.empty()) ans++;
else
{
while(!q.empty())
{
int cur=q.top();
if(cur<a) q.pop();
else break;
}
if(q.empty()) ans++;
}
}
}
printf("%d\n",(int)q.size()+ans);
}