uva10670 Work Reduction

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define MAX 200
using namespace std;

int N,M,L;

struct agency
{
char name[30];
int a,b;
long long cost;
}age[MAX];

int cmp(const void *p,const void *q)
{
if(((struct agency *)p)->cost<((struct agency *)q)->cost)
return -1;
else if(((struct agency *)p)->cost>((struct agency *)q)->cost)
return 1;
else
return strcmp(((struct agency *)p)->name,((struct agency *)q)->name);
}

void solve()
{
int i,target;
long long temp;
for(i=0;i<L;i++)
{
temp=0,target=N;
while(target/2>=M&&age[i].a*(target-target/2)>age[i].b)
{
temp+=age[i].b;
target=target/2;
}
temp+=age[i].a*(target-M);
age[i].cost=temp;
}
qsort(age,L,sizeof(age[0]),cmp);
for(i=0;i<L;i++)
printf("%s %lld\n",age[i].name,age[i].cost);
}

int main()
{
int t,i,j,p,temp;
char input[200];
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d %d %d",&N,&M,&L);
getchar();
for(j=0;j<L;j++)
{
scanf("%s",input);
/*for(p=0;p<strlen(input);p++)
if(input[p]==':'||input[p]==',')
input[p]=' ';
sscanf(input,"%s %d %d",age[j].name,&age[j].a,&age[j].b);*/
for(p=0;input[p]!=':';p++)
age[j].name[p]=input[p];
age[j].name[p]=0;//j写成i，错n次
temp=0;
for(p++;input[p]!=',';p++)
{
temp=temp*10+input[p]-'0';
}
age[j].a=temp;
temp=0;
for(p++;p<strlen(input)&&input[p]!=0;p++)
{
temp=temp*10+input[p]-'0';
}
age[j].b=temp;
}
printf("Case %d\n",i);
solve();
}
return 0;
}