srm 504.5 easy TheJackpotDivTwo

問題

http://www.topcoder.com/stat?c=problem_statement&pm=11432&rd=14514

回答

#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 TheJackpotDivTwo{
public:
  vector <int> find(vector <int> money, int jackpot){
    sort(money.begin(), money.end());
    while(jackpot > 0){
      size_t i = 0;
      while(i + 1 < money.size() && money[i + 1] == money[i]){
	i++;
      }
      money[i]++;
      jackpot--;
    }
    return money;
  }



};