Hardcore Hacks by Nishant Boro

Problem: We are given a rooted tree with N nodes where Node 1 is the root. We are asked to perform the following operation any number of times(could also be 0): Select a node and remove the whole subtree(including the node itself). Let's define Profit as the sum of all existing nodes in the tree. After performing the given operation K times subtract X*K from Profit. Find the maximum possible profit. Solution: Let's focus on understanding the last part of the problem. We define Profit as the sum of all the existing nodes in the tree. After we have performed the subtree removal operation K times, we are asked to subtract X*K from the profit. But instead of subtracting X*K at last we could subtract X from the Profit after each subtree removal operation. Since the operation is performed K times, it would mean the same thing as subtracting X*K at last would have. Keeping this in mind, let's try to find out which subtrees should be removed such that the profit could be