http://www.usaco.org/index.php?page=viewproblem2&cpid=1059

I know the algorithm for the problem above. I think it’s just finding out the 2 smallest numbers from the 7 (and those represent A and B. We use the largest number (since it’s A+b+c) and subtract the 2 smallest numbers from it to find C. However, I don’t know how to implement this with code in Java. I’m able to find the algorithms for almost all Bronze problems, but just have trouble implementing