12345678910111213141516171819202122232425262728293031323334353637383940414243444546
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
// Function to find the maximum number of content children
int findMaximumCookieStudents(vector<int>& Student, vector<int>& Cookie) {
int n = Student.size();
int m = Cookie.size();
// Pointers
int l = 0, r = 0;
// Sorting of vectors
sort(Student.begin(), Student.end());
sort(Cookie.begin(), Cookie.end());
// Traverse through both arrays
while (l < n && r < m) {
/*If the current cookie can satisfy
the current student, move to the
next student*/
if (Cookie[r] >= Student[l]) {
l++;
}
// Move to next cookie
r++;
}
// Return the number of students who got cookies
return l;
}
};
int main() {
// Example input
vector<int> Student = {1, 2};
vector<int> Cookie = {1, 2, 3};
// Create a Solution object
Solution solution;
// Call the findMaximumCookieStudents function
int result = solution.findMaximumCookieStudents(Student, Cookie);
// Output the result
cout << "Number of students satisfied: " << result << endl;
return 0;
}
12345678910111213141516171819202122232425262728293031323334353637383940414243
import java.util.*;
class Solution {
public int findMaximumCookieStudents(int[] Student, int[] Cookie) {
int n = Student.length;
int m = Cookie.length;
// Pointers
int l = 0, r = 0;
// Sorting of arrays
Arrays.sort(Student);
Arrays.sort(Cookie);
// Traverse through both arrays
while (l < n && r < m) {
/*If the current cookie can satisfy
the current student, move to the
next student*/
if (Cookie[r] >= Student[l]) {
l++;
}
// Move to next cookie
r++;
}
// Return number of students
return l;
}
public static void main(String[] args) {
// Example input
int[] Student = {1, 2};
int[] Cookie = {1, 2, 3};
// Create a Solution object
Solution solution = new Solution();
// Call the findMaximumCookieStudents function
int result = solution.findMaximumCookieStudents(Student, Cookie);
// Output the result
System.out.println("Number of students satisfied: " + result);
}
}
1234567891011121314151617181920212223242526272829303132333435
class Solution:
def findMaximumCookieStudents(self, Student, Cookie):
n = len(Student)
m = len(Cookie)
# Pointers
l, r = 0, 0
# Sorting of lists
Student.sort()
Cookie.sort()
# Traverse through both lists
while l < n and r < m:
"""If the current cookie can satisfy
the current student, move to the
next student"""
if Cookie[r] >= Student[l]:
l += 1
# Move to next cookie
r += 1
# Return number of students
return l
# Example input
Student = [1, 2]
Cookie = [1, 2, 3]
# Create a Solution object
solution = Solution()
# Call the findMaximumCookieStudents function
result = solution.findMaximumCookieStudents(Student, Cookie)
# Output the result
print("Number of students satisfied:", result)
123456789101112131415161718192021222324252627282930313233343536373839
class Solution {
findMaximumCookieStudents(Student, Cookie) {
let n = Student.length;
let m = Cookie.length;
// Pointers
let l = 0, r = 0;
// Sorting of arrays
Student.sort((a, b) => a - b);
Cookie.sort((a, b) => a - b);
// Traverse through both arrays
while (l < n && r < m) {
/*If the current cookie can satisfy
the current student, move to the
next student*/
if (Cookie[r] >= Student[l]) {
l++;
}
// Move to next cookie
r++;
}
// Return number of students
return l;
}
}
// Example input
const Student = [1, 2];
const Cookie = [1, 2, 3];
// Create a Solution object
const solution = new Solution();
// Call the findMaximumCookieStudents function
const result = solution.findMaximumCookieStudents(Student, Cookie);
// Output the result
console.log("Number of students satisfied:", result);
