UVA - 10603 Fill(bfs+ 우선 순위 큐 + 동적 계획)

It is allowed to pour water from one jug into another until either the first one is empty or the second one is full. You are to write a program that computes the least total amount of water that needs to be poured; so th...

uvafill10603