说明：  给定一个有向图，根据上面的容量和费用问题，求出最小费用最大流来解决常见的工程问题
(Given a directed graph, according to the capacity and cost issues above, find the minimum cost maximum flow to solve common engineering problems)