ACM - UVA 105 - the skyline problem

Problem: 105 - the skyline problem
Solution: C++
Hints: http://www.algorithmist.com/index.php/UVa_105
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue
include <list>
#include <vector>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <math.h>
using namespace std;

int main()
{
 int height[10001] = {0};
 int left, right, buildingHeight;

 // read our buildings
 while (cin >> left >> buildingHeight >> right)
 {
  for (int i = left; i < right; ++i)
  {
   if (buildingHeight > height[i])
    height[i] = buildingHeight;
  }
 }

 bool notFirst = false; // only show a preceeding space on the non-first entries
 int currentHeight = 0;
 for (int pos = 0; pos != 10000; ++pos)
 {
  if (height[pos] != currentHeight)
  {
   if (notFirst)
    cout << ' ';
   else    notFirst = true;
   cout << pos << ' ' << height[pos];
   currentHeight = height[pos];
  }
 }
 cout << endl;
 return 0;

}