So I just found out that my [solution](https://codeforces.com/contest/1593/submission/131883677) which is almost same as [this one](https://codeforces.com/contest/1593/submission/131880221) gets TLE on test case 8 while latter got AC.↵
↵
I can't figure-out why this happened?↵
↵
Problem link -> [C.Save More Mice](https://codeforces.com/contest/1593/problem/C)↵
↵
Solution:↵
↵
It turns out that Arrays.sort() in java uses Quicksort which has worst time complexity of O(n^2) and Collections.sort() uses that has time complexity of O(nlogn).↵
↵
refer to [this](https://www.geeksforgeeks.org/quick-sort-vs-merge-sort/) article for more information.
↵
I can't figure-out why this happened?↵
↵
Problem link -> [C.Save More Mice](https://codeforces.com/contest/1593/problem/C)↵
↵
Solution:↵
↵
It turns out that Arrays.sort() in java uses Quicksort which has worst time complexity of O(n^2) and Collections.sort() uses that has time complexity of O(nlogn).↵
↵
refer to [this](https://www.geeksforgeeks.org/quick-sort-vs-merge-sort/) article for more information.