SRM548 Div2 Easy(250) KingdomAndDucks
#include <vector> #include <set> #include <algorithm> using namespace std; class KingdomAndDucks{public: int minDucks( vector <int> duckTypes ) { vector<int> num(51); for ( int i=0; i<(int)duckTypes.size(); i++ ) num[duckTypes[i]]++; return int(set<int>(duckTypes.begin(),duckTypes.end()).size()) * *max_element(num.begin(),num.end()); }};