Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
为什么会wa呢?#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; } Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator