https://mirror.codeforces.com/problemset/problem/412/B
I couldn't understand the logic behind the first tutorial (**not** the bruteforce one). Can anyone help me?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
https://mirror.codeforces.com/problemset/problem/412/B
I couldn't understand the logic behind the first tutorial (**not** the bruteforce one). Can anyone help me?
Name |
---|
Consider the array sorted in decreasing order, and it's $$$k^{th}$$$ element speed as $$$x$$$.
As it clearly produces $$$k$$$ indices $$$[0,k-1]$$$ which have speed greater than or equal to answer. there is no reason to consider any value lower than this.
Following, If we increase the speed further, The computer at $$$k^{th}$$$ position will not be able to operate and hence total number of computers will be fall less then $$$k$$$.
Hence, $$$x$$$ is the optimal choice.