排序系列 poj2379

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct
{
	int team;
	int pro_nums;
	int time;
	bool ac[21];
	int wa[21];
}Team;
typedef struct 
{
	int ci,pi,ti,ri;
}Input;
int cmp(const void * a ,const void *b)
{
	Team *c = (Team *)a;
	Team *d = (Team *)b;
	if(c->pro_nums != d->pro_nums) 
		return d->pro_nums - c->pro_nums;
	else if (c->time!=d->time)
		return c->time - d->time;
	return c->team - d->team;
}
int cmp2(const void * a ,const void * b)
{
	return (*(Input *)a).ti - (*(Input *)b).ti;
}
int main()
{
	int C,N,i,j,teamhash[1005],ci,pi,ti,ri,k=0,index;
	Team t[1005];
	Input in[1005];
	scanf("%d%d",&C,&N);
	memset(teamhash,-1,sizeof(teamhash));
	memset(t,0,sizeof(t));
	for (i=0;i<N;i++)
	{
		scanf("%d%d%d%d",&ci,&pi,&ti,&ri);
		in[i].ci = ci;
		in[i].pi = pi;
		in[i].ti = ti;
		in[i].ri &