Milking Cows 挤牛奶

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;

bool Comp(const pair<int,int>& p1,const pair<int,int>& p2)
{
	return p1.first < p2.first;
}
int main(int argc, char const *argv[])
{
	cout<<"N?"<<endl;
	int n;
	cin>>n;
	vector<pair<int,int> > v;
	pair<int,int> newone;
	int start,end;
	for(int i=0;i<n;i++)
	{
		cin>>start;
		cin>>end;
		newone = make_pair(start,end);
		v.push_back(newone);
	}
	sort(v.begin(),v.end(),Comp);
	vector<pair<int,int> >::iterator iter;
	int a,b,c,d;
	for(vector<pair<int,int> >::iterator iter = v.begin();iter != v.end();)
	{
		a = (*iter).first;
		b = (*iter).second;
		c = (*(++iter)).first;
		d = (*(iter)).second;
		if((c <= b) && (d >= b))
		{
			(*iter).first = a;
			(*iter).second = d;
		}
		else if((a <=c) && (d <= b))
		{
			(*iter).first = a;
			(*iter).second = b;
		}
		else
		{}
	}

	int max1 = 0;
	int max2 = 0;
	for(vector<pair<int,int> >::iterator iter = v.begin();iter != v.end();)
	{
		int temp1;
		temp1 = (*iter).second - (*iter).first;
		if(temp1 > max1)
			max1 = temp1;
		int temp2;
		int a,b;
		a = (*iter).second;
		b = (*(++iter)).first;
		temp2 = b - a;
		if(temp2 > max2)
			max2 = temp2;
	}
	cout<<max1<<' '<<max2<<endl;
	return 0;
}

时间复杂度(O(nlogn)+n)!