> bool ok()
> {
> 	int i, j, day, min, max;
> 	sort(m, m+n);
> 	min = m[0].begin;
> 	max = 0;
> 	for (i = 0; i < n; i++)
> 		if (m[i].end > max) max = m[i].end;
> 	size = 0;
> 	for (day = min, i = 0; day <= max; day++)
> 	{
> 		for (; i < n && m[i].begin == day; i++)
> 			push(m[i].end);
> 		for (j = 0; j < p && size > 0; j++)
> 		{
> 			if (heap[1] < day) return false;
> 			pop();
> 		}
> 	}
> 	return size == 0;
> }