AC#789求调

#include<bits/stdc++.h>
using namespace std;
struct tiger{
	int start,end;
};
vector<tiger> arr(1000000);
bool mc(tiger a,tiger b){
	if(a.end!=b.end)
	return a.end<b.end;
	return a.start<b.start;
}
int main(){

   int n,sum=0;
   cin>>n;
	for(int i=0;i<n;i++){
		cin>>arr[i].start>>arr[i].end;
	}
	sort(arr.begin(),arr.end(),mc);
int end1=INT_MIN;
	for(int i=0;i<n;i++){
		int s=arr[i].start;
		int e=arr[i].end;

		if(s>=end1){
			cout<<end1<<endl;
		sum++;
		end1=e;
	}}
   cout<<sum;
	return 0;
}