Poj_2232 Moo volume

Question link: http://poj.org/problem? Id = 2231

 

Ideas:

Sort and then derive the formula.

Code:

# Include <iostream> # include <algorithm> using namespace STD; int main () {long int ans = 0, arr [10010]; int n, m; cin> N; For (INT I = 0; I <n; ++ I) {CIN> arr [I];} Sort (ARR, arr + n ); for (INT I = 0; I <n; ++ I) {ans + = (n-1-i) * (ARR [n-1-i]-Arr [I]);} cout <ans * 2 <Endl; return 0 ;}

 

Poj_2232 Moo volume