整数解

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8443    Accepted Submission(s): 2872

9 15
5 4
1 -56
0 0

No
Yes
Yes

 <br /> #include<iostream><br /> #include<cstring><br /> #include<cstdlib><br /> #include<cstdio><br /> #define MAX 1000<br /> using namespace std;</p> <p>typedef struct<br /> {<br /> char name[11];<br /> int sum;<br /> int total;<br /> }credit;<br /> int cmp(const void *a,const void *b)<br /> {<br /> if((*(credit *)a).total !=(*(credit *)b).total)<br /> return (*(credit *)a).total-(*(credit *)b).total;<br /> else if((*(credit *)b).sum!=(*(credit *)a).sum)<br /> return (*(credit *)b).sum-(*(credit *)a).sum;<br /> else return strcmp((*(credit *)b).name,(*(credit *)a).name);<br /> }</p> <p>int main()<br /> {<br /> int res,t,f;<br /> int i,n,m,j;<br /> char style[11];<br /> credit c[MAX]={0};</p> <p> //freopen("in.txt","r",stdin);</p> <p> scanf("%d%d",&n,&m);<br /> for(i=0;scanf("%s",c[i].name)!=EOF;i++)<br /> {<br /> for(j=0;j<n;j++)<br /> {<br /> scanf("%s",style);<br /> res=sscanf(style,"%d(%d)",&t,&f);<br /> if(res==2)<br /> {<br /> c[i].total++;<br /> c[i].sum+=t+f*m;<br /> }<br /> else if(res==1 &&t>0)<br /> {<br /> c[i].total++;<br /> c[i].sum+=t;<br /> }<br /> }<br /> }<br /> qsort(c,i,sizeof(credit),cmp);<br /> for(i--;i>=0;i--)<br /> printf("%-10s %2d %4d/n",c[i].name,c[i].total,c[i].sum);<br /> return 0;<br /> }