SRM 506 div2 easy SlimeXSlimeRancher2

問題

http://www.topcoder.com/stat?c=problem_statement&pm=11279&rd=14435 (要ログイン)

方針

やるだけ。

回答

#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iterator>


using namespace std;


class SlimeXSlimeRancher2{
public:
  int train(vector <int> attributes){
    int m = 0;
    size_t n = attributes.size();
    for(size_t i = 0; i < n; ++i){
      m = max(attributes[i], m);
    }
    int ret = 0;
    for(size_t i = 0; i < n; ++i){
      ret += m - attributes[i];
    }
    return ret;
  }



};