Uva 591 - Box of Bricks

没什么说的，不过因为想尝试一下C++，由于scanf导致 了两次CE，唉~~~

#include<iostream> #include<list> using namespace std; int main(void) { int n,set = 0; while(cin>>n && n != 0) { list<int> vec; int sum =0,count = 0; set++; int t; for(int i = 0;i < n;i++) { cin >> t; vec.push_back(t); sum += vec.back(); } int ave = sum/n; vec.sort(); for(list<int>::const_iterator p = vec.begin(); *p < ave; ++p) count += (ave - *p); cout <<"Set #"<<set<<endl <<"The minimum number of moves is "<< count<<"."<<endl << endl; } return 0; }