Problem Link:Here

I have already solved this problem using Dp.
But in Tag I have seen that it can be solved with Min cost Max flow.
Give some Hints how can i solve this problem using Min cost Max flow.
Thanks in Adavance

Problem Accepted Solution Runttime error code

I sort some value that are stored in some vector(2D) lst[]

bool cmp(i64 a,i64 b){
 return a>b
}
sort(lst[i].begin(),lst[i].end(),cmp)

This is my accepted code customize sort

In second code

bool cmp(i64 a,i64 b){
 return a>=b
}
sort(lst[i].begin(),lst[i].end(),cmp)
This code got Runtime error.

My question is that if my customize funtion in 2nd code is

wrong then My verdict will be Wrong but why Runtime Error. Thanks in Advance.

For preprocessing in segment tree and sparse table Both takes O(nlogn) times. And in every query both takes O(log(n)) times. But How sparse Table faster than Segment tree? Thanks in Advance.