. - 力扣（LeetCode）

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