https://codeforces.com/problemset/problem/412/B
I couldn't understand the logic behind the first tutorial (**not** the bruteforce one). Can anyone help me?
https://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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.