You've got my money and no friends. You know the price P[i] of the piece of candy that would make each of your 1in friends happy. You want to give out the m dollars in a way that makes as many of your friends happy as possible. Make a greedy programme that takes O(n log n) time to figure out how much money you will give each friend.

You've got my money and no friends. You know the price P[i] of the piece of candy that would make each of your 1in friends happy. You want to give out the m dollars in a way that makes as many of your friends happy as possible. Make a greedy programme that takes O(n log n) time to figure out how much money you will give each friend.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter21: Simulation

Section21.5: Simulations With Continuous Random Variables

Problem 7P

See similar textbooks

Similar questions

Suppose you open a small shop and can't pay electronically. There are only four kinds of coins in the cashbox: 25 cents, 10 cents, 5 cents and 1 cent. If you are a salesperson and want to change 41 cents for customers, how can you arrange to give customers the right amount of money and the least number of coins? The idea:Take the coin with largest denomination without exceeding the remaining amount of cents, make the locally best choice at each step.
Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using these three buckets, we can perform any number of the following two types of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. Although we may not be able to completely fill the size-M bucket, but we can still determine the maximum amount of milk we can possibly add to largest bucket. Sample input: 17 25 77 Sample output: 76 In this example, we fill the bucket of size 17 three times and then bucket of size 25 once, accumulating a total of 76 units of water. You could use additional test case to test your program: Input: 52 791 877 Output: 843 Input: 26…
Write a python program based on the discussion we had on the last day of class, to train a network with two hidden layers each with 5 neurons. Finish the gradient computation we did in class, and implement a steepest decent search for a network which minimizes the cost function. Once you believe that your network is trained, compute the value of n(1, 1) and see what you get. Bonus: If you easily get this to work, then try to generalize to K neurons in each of the two hidden layers. Does the training work better with more neurons?
Imagine you are an avid movie goer and you prepared a list of n movies you are considering watching. As a thorough researcher, you prepared a list of k friends, whose movie advice you trust. For each movie, you are debating whether to either see it or speak to all of your friends and hear their recommendations. A more efficient approach is to choose between watching the movie and speaking with at least one trusted movie recommender friend. This approach will take a total of t hours. Prove that the problem is NP-hard.
You own a fruit shop. You buy fruit from suppliers by weight (cost per kg), and then you sell it either loose or pre-packaged for a fixed price. For example, a typical sale could be: 1. Apples Pink Lady 1.360kg x $3.50/kg = $4.76 2. Pears Golden 3.400kg x $1.75/kg = $5.95 3. Apples Green Smith 2.180kg x $2.50/kg = $5.45 4. Breakfast package 2x $5/pk = $10 5. Mandarins package 1x $3/pk = $3 -- Total $29.16 Where "Breakfast package" might consist of: a. Bananas Cavandish 500g b. Apples Green Smith 500g c. Mandarin Imperial 500g And "Mandarins package" is: a. Mandarins Imperial 600g b. Mandarins Queens 400g Question ----------- How can I create a relational database schema to record stock and sales? MYSQL
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution.
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution. You…
Please answer this Python in the simplest way. A1input.txt B001,book,Patriot Games, 15.95B002,book,Origin, 19.95C001,cloth,Armani Suit, 800.00B003,book,Animal Farm, 9.97B004,book,Grant, 22.50E001,elect,EyePhone 10,795.00E002,elect,First Alert Smoke Alarm, 29.95F001,food,Moose Drool Ale 6-pack, 9.95C002,cloth,Pants, 39.95B005,book,Prairie Fires, 18.95E003,elect,Sony Prtable Radio, 15.00C003,cloth,Vasque Hiking Boots, 109.00C004,cloth,Wool Hat, 14.00F002,food,Jumbo shrimp, 12.50E004,elect,HP Laptop, 350.00C005,cloth,Wrangler Jeans, 24.50B005,book,Ragtime, 17.25F003,food,Fusili - 16 oz., 2.95C006,cloth,Nike T-shirt, 19.00C007,cloth,Gore-Tex Gloves, 39.00C008,cloth,North Face Fleece Jacket, 89.95C009,cloth,Nationals Logo Sweatshirt, 49.00E005,elect,LinkSys Router, 49.95F004,food,Lamb Chops, 21.95C010,cloth,New Balance Trail Runners,69.95E006,elect,Altec Lansing Speakers, 195.95B006,book,Future Shock, 8.95E007,elect,LG 55 UDTV,350.00E008,elect,Dell All-in-One PC, 495.00E009,elect,Brother…
To cut an 'n' centimeter-long gold bar into 2 pieces costs $n. When a gold bar is cut into many pieces, the order in which the cuts occur can affect the total amount of costs. For example, to cut a 20 centimeter gold bar at length marks 2, 8, and 10 (numbering the length marks in ascending order from the left-hand end, starting from 1). If the cuts to occur in left-to-right order, then the first cut costs $20, the second cut costs $18 (cutting the remaining 18 centimeter bar at originally length mark 8), and the third cut costs $12, totaling $50. If the cuts to occur in right-to-left order, however, then the first cut costs $20 time, the second cut costs $10, and the third cut costs $8, totaling $38. In yet another order, the first cut is at 8 (costing $20), then the 2nd cut is at 2 (costing $8), and finally the third cut is at 10 (costing $12), for a total cost of $40. Given an 'n' centimeter-long gold bar G and an array C[1..m] containing the cutting points in ascending order): a.…
Phineas goes to school after the lockdown is over and finds out that all his N−1N−1 friends have turned into bullies. So he himself too starts disliking his friends. The teacher Dr Doof wants to distribute MM marks to his NN students (including Phineas). Dr Doof is busy in his experiments and so wants the students to distribute MM marks among themselves such that each student gets a non negative integer marks or gets expelled. So he makes a plan. He makes all of his NN students stand in an line and then the NthNth student is made the leader. The task of the leader is to propose the distribution of MM marks among all the students present. Then a voting is carried out and all present students ( including the leader) can vote either for or against the distribution. If the distribution is voted for by at least 50%50% of the students present, then it is is approved with the leader becoming the deciding student and the process ends. Otherwise the last KK present students are expelled (…
You want to cut a rectangle pan of brownies, but you can only cut horizontally or vertically. To divide the pan into n individual brownies, how many slices will you need to make? Induce your response strongly.
The given time complexity is: m T(m-1) + ca > 1 cb = 0 expanding using substitution: m T(m-1) + ca m[(m-1) T(m-2) + ca]+ ca m(m-1) T(m-2) + mca + ca m(m-1) [(m-2) T(m-3) + ca] + mca + ca m(m-1)(m-2) T(m-3) + m(m-1)ca + mca + ca what is the time complexity? form an expression for adding all the ca