Help in forming two disjoint sets

Правка en1, от silversRayleigh, 2018-09-05 07:17:45

Hello Everyone,

I was trying to solve a problem in which I was given a set of number(in range 1-10^5 and size of set is at max 10^5). Task was to form the two disjoint sets from the given set such that sum of elements of each set is at least X(in range 1-10^5) and sum of size of both sets is minimized.

I tried a lot but could only come up with O(n^2) solution. Can anyone please suggest some idea on how to do it?

Note : Union of disjoint sets need not be the original set.


Теги #help


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский silversRayleigh 2018-09-05 07:17:45 524 Initial revision (published)