given a bipartite graph we call L as the left one and R as the right one for each node i we choose in L we have to pay a[i] dollar there are also m edge which link the L to R ask : what is the minumum value of choose some node in L so that every node in R have at least 2 node in L is linked to this is chosen p/s sorry for my poor Engligh but if you understand the statement please give feedback