Numbers from $1$ to $49$ are randomly placed in a $35 \times 35$ table such that number $i$ is used exactly $i$ times. Some random cells of the table are removed so that table falls apart into several connected (by sides) polygons. Among them, the one with the largest area is chosen (if there are several of the same largest areas, a random one of them is chosen). What is the largest number of cells that can be removed that guarantees that in the chosen polygon there is a number which occurs at least $15$ times?
Problem
Source: Kazakhstan national olympiad 2022, grade 9, p6
Tags: combinatorics, numbers in a table, table, Kazakhstan, construction