SRM495 Div2 Easy(250) CarrotBoxesEasy
#include <vector> #include <algorithm> using namespace std; class CarrotBoxesEasy{public: int theIndex( vector <int> carrots, int K ) { int m = 0; for ( int i=0; i<K; i++ ) m = max_element(carrots.begin(),carrots.end())-carrots.begin(), carrots[m]--; return m; }};