문제<\/h2>
Hermione loves to play the following computer game, in which the player controls an unordered multiset of integers. Initially, the multiset is empty and the player's score is $0<\/mn><\/mrow>0<\/math><\/span><\/span> 0<\/span><\/span><\/span><\/span>. At any moment in the game, the multiset contains at most k<\/mi><\/mrow>k<\/math><\/span><\/span> k<\/span><\/span><\/span><\/span> integers (not necessarily distinct). In one turn, the player can choose one of the following moves:<\/p> Insert<\/strong>. Choose an integer 2<\/mn><\/mrow>2<\/math><\/span><\/span> 2<\/span><\/span><\/span><\/span> or 4<\/mn><\/mrow>4<\/math><\/span><\/span> 4<\/span><\/span><\/span><\/span> and insert it into the multiset. This move does not change the score, and it is only allowed if the size of the multiset before the move is strictly less than k<\/mi><\/mrow>k<\/math><\/span><\/span> k<\/span><\/span><\/span><\/span>.<\/li> Merge<\/strong>. Choose an integer x<\/mi><\/mrow>x<\/math><\/span><\/span> x<\/span><\/span><\/span><\/span> such that the multiset contains at least two copies of x<\/mi><\/mrow>x<\/math><\/span><\/span> x<\/span><\/span><\/span><\/span>. Remove two copies of x<\/mi><\/mrow>x<\/math><\/span><\/span> x<\/span><\/span><\/span><\/span> from the multiset, and insert one copy of$

High Score