You have m dollars and a group of n friend. For each friend 1 ≤ i ≤n, you know the price P[i] of the piece of candy that would make your friend happy. You want to find a way to distribute the m dollars such that as many of your friends as possible are happy. Design an O(n log n) time greedy algorithm to find how much money you will allocate each friend.
You have m dollars and a group of n friend. For each friend 1 ≤ i ≤n, you know the price P[i] of the piece of candy that would make your friend happy. You want to find a way to distribute the m dollars such that as many of your friends as possible are happy. Design an O(n log n) time greedy algorithm to find how much money you will allocate each friend.
Related questions
Question
I need the algorithm, proof of correctness and runtime analysis for the problem. No code necessary ONLY algorithm. And runtime should be O(n log n) as stated in the question.
![You have m dollars and a group of n friend. For each friend 1 ≤ i ≤n, you know the price
P[i] of the piece of candy that would make your friend happy. You want to find a way to distribute the m
dollars such that as many of your friends as possible are happy. Design an O(n log n) time greedy algorithm
to find how much money you will allocate each friend.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F98182d17-9434-4dd7-9261-6c7c628c58da%2Fcfdfe190-5f70-47e0-9918-a944ab3782e4%2Fy3mooml_processed.png&w=3840&q=75)
Transcribed Image Text:You have m dollars and a group of n friend. For each friend 1 ≤ i ≤n, you know the price
P[i] of the piece of candy that would make your friend happy. You want to find a way to distribute the m
dollars such that as many of your friends as possible are happy. Design an O(n log n) time greedy algorithm
to find how much money you will allocate each friend.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 images
