Submission #76637134

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//#define int ll
//#define ll long long
#define pb emplace_back
#define pr pair<int,int>
#define mp make_pair
#define endl "\n"
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void write(int x)
{
    if(x<0)putchar('-'),x=-x;
    if(x<10)putchar(x+'0');
    else write(x/10),putchar(x%10+'0');
}
int n;
pr d[300005];
int minx[300005],miny[300005];
bool cmp1(pr q,pr p){return q.first<p.first;}
bool cmp2(pr q,pr p){return q.second<p.second;}
signed main(){
	n=read();
	for(int i=1;i<=n;i++){d[i].first=read();d[i].second=read();}
	sort(d+1,d+1+n,cmp1);
	miny[0]=INT_MAX;
	for(int i=1;i<=n;i++) miny[i]=min(miny[i-1],d[i].second);
	sort(d+1,d+1+n,cmp2); 
	minx[0]=INT_MAX;
	for(int i=1;i<=n;i++) minx[i]=min(minx[i-1],d[i].first);
	int ans=0;
	for(int i=1;i<=n;i++){
		if(d[i].second<=miny[d[i].first-1]&&d[i].first<=minx[d[i].second-1]) ans++;
	}
	cout<<ans;
	return 0;
}

Submission Info

Judge Result