class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
int count = 0;
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int j = 0 , i = 0;
for ( ; i < s.size() && j < g.size() ; i++) {
if (s[i] >= g[j]) {
count++;
j++;
}
}
return count;
}
};
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
int count = 0;
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int j = 0 , i = 0;
for ( ; i < s.size() && j < g.size() ; i++) {
if (s[i] >= g[j]) {
count++;
j++;
}
}
return count;
}
};