I was trying to solve this problem http://codeforces.net/gym/100703/problem/F

In the discussion given, people have discussed about DP and flows solution to the problem. The DP is well understood.

Can someone please explain the flows solution for the problem?

Also, is there a way to ensure exactly k edges are selected in the min-cut of a network?

Thanks in advance.