class Solution { public: int findContentChildren(vector<int>& g, vector<int>& s) { sort(g.begin(), g.end()); sort(s.begin(), s.end()); int maxg = g.size(),maxs = s.size(); int child = 0,cookie = 0; // while(child < g.size() && cookie < s.size()){ // if(g[child] <= s[cookie]) ++child; // ++cookie; // } for( cookie; cookie < maxs; cookie++){ if(g[child] <= s[cookie]){ child++; }; if(child>=maxg) break; } return child; } };