1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
| class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int i = 0, j = 0;
int m = g.size(), n = s.size();
while(j < n && i < m)
{
if(s[j] >= g[i])
++i;
++j;
}
return i;
}
};
|