杭电 acm Box of Bricks

#include<iostream>#include<algorithm>using namespace std;int main(){    int n,a[100],sum=0,ave,kase=0,coun=0;    while(cin>>n&&n!=0)    {        coun++;        for(int i=0;i<n;i++)        {            cin>>a[i];            sum+=a[i];        }        ave=sum/n;        sort(a,a+n);        for(int i=0;i<n;i++)        {            if(a[i]<ave)            {                kase=kase+(ave-a[i]);            }        }        cout<<"Set #"<<coun<<endl;        cout<<"The minimum number of moves is "<<kase<<"."<<endl<<endl;        kase=0,sum=0;    }    return 0;}