vector<int>h3(n3);for(inth3_i =0;h3_i < n3;h3_i++){ cin>>h3[h3_i]; l3+=h3[h3_i]; }inti1 =0, i2 =0, i3 =0;while(!(l1 == l2 && l2 ==l3)) {//which stack is highest now?intmaxi =1;intmaxl =l1;if(maxl <l2) { maxi=2; maxl=l2; }if(maxl <l3) { ...