a problem of the kth largest value query

Правка en1, от sonthaile2002, 2019-08-19 17:43:23

You are given an array a of n integers (n <= 1e5, a [i] <= 1e5) and m (m <= 1e4) the query has the form (x, y) meaning that finding the xth largest value is made by y consecutive numbers in array a. please help me solve this problem? Thanks. And sorry because of my poor English.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский sonthaile2002 2019-08-19 17:43:23 321 Initial revision (published)