Assume a codeforces like platform where there are n users and their ratings vary over time $$$[0, T]$$$. Now given an interval $$$[l,r]$$$, we would like to find top k profiles which had highest delta in that interval.

Is it possible to answer this with better complexity than $$$O(n\log(n)\log(T))$$$ which we can get by maintaing fenwick tree per user and sorting the list of interval sums.