Greedy - though simple, but fun! #include <vector>#include<iostream>usingnamespacestd;intmain(){intn1;intn2;intn3; cin>> n1 >> n2 >>n3;longlongl1 =0, l2 =0, l3 =0; vector<int>h1(n1);for(inth1_i =0;h1_i < n1;h1_i
Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they're all the same height, then print the height. The removals must be pe...