PAINT CHEF CITY

PAINTRD In Chef City, there are n cities connected by m one-way roads. Master Chef can paint any of these roads. It costs d unit of money where d is the length of that road. His task is to paint some of the roads so that the painted roads can be partitioned into some disjoint cycles such that every vertex appears in exactly k of these disjoint cycles. But he has to minimize the costs of paintin