aim : minimize the sum of elements of a sorted set of size k. mehdi's solution is correct, 1. sort the whole array, 2. and then as you add new element to the set a. delete the oldest element added along with its difference b. add the difference of the newly added element.
O(nlogn) On Nov 19, 11:36 am, Zyro <[email protected]> wrote: > sorry...minimize sum of the difference between the elements of the > subset.. > > On Nov 19, 10:03 am, shady <[email protected]> wrote: > > > > > > > > > what do you mean by difference among them ? > > do we need to select the elements to minimize the sum between > > consecutive elements ? or only the first and last element ? > > > On Nov 18, 6:30 pm, Zyro <[email protected]> wrote: > > > > Q: Select the K elements in an array of size N which are having the > > > minimum difference among them? > > > For Example : If you have an array like arr[]={9,5,2,6,3,11} and value > > > of K is 3. Then ans would be {2,3,5}. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
