CareerCup

solution in C
1. build sorted array of all starting points and another array for all ending points then
2. use following algorithm to build result array
// create sorted array first

while(i<array_size && j<array_size)
	{
		result[cnt][0] = start_point[i++];
		
		while(end_point[j] > start_point[i])
		{
			i++; j++;				
		}
		result[cnt][1] = end_point[j++];
		cnt++;			
	}

#define M 5
#define N 5

int arr[M*N];

int update(int p, int c){
if(c<1 || p<1) return 0;

int pos = ((M-c)*N);

while (arr[pos] != 0)
pos++;
arr[pos] = p;
}