SRM504.5 Div2 Easy(250) TheJackpotDivTwo
#include <vector> #include <algorithm> using namespace std; class TheJackpotDivTwo{public: vector <int> find( vector <int> money, int jackpot ) { for ( int i=0; i<jackpot; i++ ) ++*min_element(money.begin(),money.end()); sort(money.begin(),money.end()); return money; }};