Is O(KNlogN) not enough to pass the time complexity limit? My solution in O(K*N)


#1

Is O(KNlogN) not enough to pass the time complexity limit? My solution in O(K*N) still gets TLE, there is a problem with the evaluator or something?