455. 分发饼干

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