In one kingdom a knight tournament takes place every year. 128 knight participate in it. Relative strength of every knight is known from previous tournaments, it is unique so they can be sorted by strength from 1 to 128 (so that we have exactly i  1 knights weaker than ith knight). In every fight of tournament only two knights meet and stronger one definitely beats weaker one. Stronger knight goes to the next round, weaker one falls off tournament (and goes home). Rounds repeat until only one strongest knight is left, which will be declared the winner of whole tournament.
The smaller difference between knights power is, the longer fight between those knights lasts: ith and jth knights will fight 10 × ( 128 −  i − j  ) seconds.
King decides himself who will fight with who, but he wants that total time spent watching tournament was maximum.

how to make pairs for all tournament to maximise watching time?

how to maximise total watching time spent by all viewers if every kth round is visited by twice more people than round #(k  1) for k equals 2 … 7?

how to maximise total watching time spent by all viewers if every kth round is visited by 5 times more people than round #(k  1) for k equals 2 … 7?

how does tournament look like if there are only four participants?

how does king’s time spent watching every round depends on winners of those round?

how to minimise all wiever’s total time spent watching tournament?