L - Ticket Revenue Maximization

There is going to be a tournament with $128$ teams numbered $1, 2, \ldots, 128$. For each $i < j$, the team $j$ is stronger than the team $i$, and in a match between them, the team $j$ always wins. For each $i$, the team $i$ has $P_i$ supporters. No two teams have any common supporters. There will be $7$ rounds in the tournament. In each round, the teams will be divided into pairs, such that each