leetcode

0 class Solution {

1 public:

2 int findContentChildren(vector<int> &g, vector<int> &s) const {

3 sort(rbegin(g), rend(g));

4 sort(rbegin(s), rend(s));

5 int i = 0, j = 0;

6 while (i < g.size() && j < s.size()) {

7 if (g[i] <= s[j]) j++;

8 i++;

9 }

10 return j;

11 }

12 };