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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 170 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 148 |
8 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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.