you give integer n indicate n specialty retail store there m product type vary amount give 0indexed integer array quantity quantitiesi represent number product ith product typeyou need distribute product retail store follow rulesa store give product type give itaft distribution store give number product possibly 0 let x represent maximum number product give store you want x small possible ie want minimize maximum number product give storereturn minimum possible x example 1input n 6 quantity 116output 3explanation one optimal way the 11 product type 0 distribute store amount 2 3 3 3 the 6 product type 1 distribute store amount 3 3the maximum number product give store max2 3 3 3 3 3 3example 2input n 7 quantity 151010output 5explanation one optimal way the 15 product type 0 distribute store amount 5 5 5 the 10 product type 1 distribute store amount 5 5 the 10 product type 2 distribute store amount 5 5the maximum number product give store max5 5 5 5 5 5 5 5example 3input n 1 quantity 100000output 100000explanation the optimal way the 100000 product type 0 distribute storeThe maximum number product give store max100000 100000 Constraintsm quantitieslength1 m n 1051 quantitiesi 105