You are given a 2D integer array intervals , where intervals[i] = [l _i , r _i , weight _i ] . Interval i starts at position l _i and ends at r _i , and has a weight of weight _i . You can choose up to 4 non-overlapping intervals. The score of the chosen intervals is defined as the total sum of their weights.
Return the lexicographically smallest array of at most 4 indices from intervals with maximum score, representing your choice of non-overlapping intervals.
Two intervals are said to be non-overlapping if they do not share any points. In particular, intervals sharing a left or right boundary are considered overlapping.
1 <= intevals.length <= 5 * 10 ^4intervals[i].length == 3intervals[i] = [l _i , r _i , weight _i ]1 <= l _i <= r _i <= 10 ^91 <= weight _i <= 10 ^9