I'm trying all combinations of horns and hoofs amount which sum is not larger than K, calculating its profit and store minimal. The direction of bruteforce should give least amount of horns and hoofs if there are equal profit for several combination.

Of course I should use simple calculation instead of bruteforce, but why my stupid program got WA (not time limit) on test 7 ? ;)