Submission #1245506

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)N;i++)
#define p(s) cout<<(s)<<endl
using namespace std;
const int inf=1e9;

int main(){
	int n;
	cin>>n;
	vector<pair<int,int>> a;
	REP(i,0,n) {
		int w,h;
		cin>>w>>h;
		a.push_back({h,-w});
	}
	sort(a.begin(),a.end());
	vector<int> b(n,inf);
	REP(i,0,n) 	*lower_bound(b.begin(),b.end(),-a[i].second)=-a[i].second;

	p(lower_bound(b.begin(),b.end(),inf) - b.begin());
	return 0;
}

Submission Info

Judge Result