杭電 acm Box of Bricks

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,a[],sum=,ave,kase=,coun=;
    while(cin>>n&&n!=)
    {
        coun++;
        for(int i=;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        ave=sum/n;
        sort(a,a+n);
        for(int i=;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=,sum=;
    }
    return ;
}