经典指数          
POJ
原因
920
浏览数
0
收藏数
 

Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall. Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible. 输入描述 The input includes several cases. For each case, the first line contains two integers输出描述 For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.输入例子 5 5 2 2 5 3 2 3 4 2 1 5 3 1 2 5 1 2 输出例子 4

     举报   纠错  
 
切换
暂时还没有答案,欢迎分享你的解答 . . .
撰写答案
扫描后移动端查看本题