Uva 105 The Skyline Problem

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<stack>
using namespace std;

int height[10010];

int main()
{
	memset(height,0,sizeof(height));
	int i;
	int left,high,right;
	while(scanf("%d %d %d",&left,&high,&right)!=EOF)
	{
		for(i=left;i<=right;i++)
		{
			if(height[i]<high)
				height[i]=high;
		}
	}
	int start=0;
	while(height[start]==0)
		start++;
	printf("%d %d",start,height[start]);
	for(i=start+1;i<=10010;i++)
	{
		if(height[i-1]<height[i])
		{
			printf(" %d %d",i,height[i]);
		}
		else if(height[i-1]>height[i])
		{
			printf(" %d %d",i-1,height[i]);
		}
	}
	printf("\n");
	return 0;
}