We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I implement a func f(A,B)(k, threshold) which calculate the smallest sum of k people's appeti. by maintaining min-heap of size k, and binary search from 1 to N
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mangoes
You are viewing a single comment's thread. Return to all comments →
I implement a func f(A,B)(k, threshold) which calculate the smallest sum of k people's appeti. by maintaining min-heap of size k, and binary search from 1 to N