> #include<iostream.h>
> #include<stdlib.h>
> int compare(const void *ele1,const void * ele2)
> {
> 	return (*(int*)ele1)-(*(int*)ele2);
> }
> void main()
> {
> 	int pieces[20000];
> 	int num;
> 	cin>>num;
> 	for(int i=0;i<num;i++)
> 	{
> 		cin>>pieces[i];
> 	}
> 	qsort((void*)pieces,num,sizeof(pieces[0]),compare);
> 	int cost=0;
> 	int temp;
> 	for(i=1;i<num;i++)
> 	{
> 		pieces[i]=pieces[i]+pieces[i-1];
> 		cost+=pieces[i];
> 
> 		temp=pieces[i];
> 		for(int j=i+1;j<num;j++)
> 		{
> 			if(temp>pieces[j])
> 			{
> 				pieces[j-1]=pieces[j];
> 			}
> 			else {break;}
> 		}
> 		pieces[j-1]=temp;
> 	}
> 	cout<<cost<<endl;
> }
把cost的类型改成long long 就可以了

• Re:为什么会wa呢？ (40) BJ051155 2007-07-11 09:04:03