1.2.4 Box of Bricks

找出一共比平均数少了几块砖就是答案，注意输出格式

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