1913.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1913 on 2006-01-11 at 19:10:59 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX = 51200;

class Interval {
public:
	int l, r;
	void make();
	bool operator <(const Interval&) const;
};
void Interval::make() {
	scanf("%d %d", &l, &r);
}
bool Interval::operator <(const Interval& i) const {
	return l < i.l;
}

int main()
{
	Interval in[MAX];
	int i, n;
	
	while(scanf("%d", &n) != EOF) {
		for(i = 0; i < n; i++) in[i].make();
		sort(in, in+n);
		int r = 0;
		for(i = 0; i < n; i++) {
			if(r < in[i].l) {
				if(r != 0) printf("%d\n", r);
				printf("%d ", in[i].l); r = in[i].r;
			} else r = max(r, in[i].r);
		}
		printf("%d\n", r);
	}
	
	return 0;
}