-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathAssign Cookies.cpp
33 lines (25 loc) · 1016 Bytes
/
Assign Cookies.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/*
Solution by Rahul Surana
***********************************************************
Assume you are an awesome parent and want to give your children some cookies.
But, you should give each child at most one cookie.
Each child i has a greed factor g[i], which is the minimum size of a cookie that
the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i],
we can assign the cookie j to the child i, and the child i will be content.
Your goal is to maximize the number of your content children and output the maximum number.
***********************************************************
*/
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int n = s.size();
int c = 0;
for(int i = 0; i < n; i++){
if(g[c] <= s[i]) c++;
if(c == g.size()) break;
}
return c;
}
};