166

 

10912

 

116

 

 

196

 

872

 

124

 

452

 

10937

 

10349

This is a bipartite matching problem. This can be solved using Ford fulkerson algorithm for Max flow problem.

 

10076

Problem description error: ∆T = ⌈β2(h2 − h1)⌉ + γ, if h1 < h2 , here if we use  γ as problem description,we get WA from online judge,so use δ here to get accepted.