Candy Distribution

[arushi-2298]

Given an array A[ ] of positive integers of size N, where each value represents the number of candies in a packet. Each packet can have a variable number of candies. There are M students, the task is to distribute candy packet among M students such that :

1. Each student gets exactly one packet.
2. The difference between maximum number of candies given to a student and minimum number of candies given to a student is minimum.

Kindly assign me do in c++

[Niraj-1729]

kindly assign this to me