答案
#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;
bool mycomp(int i, int j){ return i > j; }
class GogoXBallsAndBinsEasy{
public:
int solve(vector <int> T){
vector<int> s = T;
std::sort(s.begin(), s.end(), mycomp);
int ret = 0;
for(size_t i = 0; i < T.size(); i++){
ret += s[i] - T[i] > 0 ? s[i] - T[i] : 0;
}
return ret;
}
};