c++中的qsort

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#define E 100001

struct tim
{
	int begin;
	int end;
}time0[E];

int cmp(const void*,const void*);

int main()
{
	int n;
	memset(time0,0,sizeof(time0));
	scanf("%d",&n);
		
	for(int i=0;i<n;i++)
	{
		scanf("%d%d",&time0[i].begin,&time0[i].end);
	}
	qsort(time0,n,sizeof(time0[0]),cmp);
	
//	for(int i=0;i<n;i++)printf("\n%d %d\n",time0[i].begin,time0[i].end);
	
	int ansBegin[E],ansEnd[E];
	memset(ansBegin,0,sizeof(ansBegin));
	memset(ansEnd,0,sizeof(ansEnd));
	
	ansBegin[0]=time0[0].begin;
	ansEnd[0]=time0[0].end;
	int k=0;
	
	for(int i=1;i<n;i++)
	{
		if(time0[i].begin<=ansEnd[k])
		{
			if(time0[i].end>ansEnd[k])ansEnd[k]=time0[i].end;
		}
		else
		{
			k++;
			ansBegin[k]=time0[i].begin;
			ansEnd[k]=time0[i].end;
		}
	}		
	printf("%d\n",k+1);
	for(int i=0;i<=k;i++)
	{
		printf("%d %d\n",ansBegin[i],ansEnd[i]);
	}
	return 0;
}

int cmp(const void* elem1,const void* elem2)
{
	return ((struct tim*)elem1)->begin - ((struct tim*)elem2)->begin;//用指针取出结构体中的元素作为关键字进行排序
}