Min cost Max Flow
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
Codeforces Round 946 Solution Discussion