How to find optimal partition subsets


Given an partition [0,1],there are 5000 partition subsets Pi=[ai1,ai2]∈[0,1], 0≤ai1≤ai2≤1, i=1,2,…,5000. I want to analyze these subsets and find 10 subsets to contain sixty or seventy percent of the subsets. These 10 subsets could be disjoint, even overlapped.