Can someone help me with how I can remove TLE in this python code : 139519137 This is the same Algorithm but in C++ : 139524288 I guess O(nlogn) shouldn't be a TLE in python for n=1e5 Here is the Problem 1617C - Paprika and Permutation Thanks
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Can someone help me with how I can remove TLE in this python code : 139519137 This is the same Algorithm but in C++ : 139524288 I guess O(nlogn) shouldn't be a TLE in python for n=1e5 Here is the Problem 1617C - Paprika and Permutation Thanks
| Name |
|---|



Bruh, check your python submission link, it's in C++. (though I didn't downvoted)
Also, it is a bit common for Python code to TLE when the time limit is very tight, which usually happens on higher problems of Div2 (like D, E ...). But, it's rare to happen on C.