## Shiina Mashiro no youni

Masshiro na kimochi ni nate

# POJ 2104 - K-th Number

Description

You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.
That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: "What would be the k-th number in a[i...j] segment, if this segment was sorted?"
For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2, 5, 3). The segment a[2...5] is (5, 2, 6, 3). If we sort this segment, we get (2, 3, 5, 6), the third number is 5, and therefore the answer to the question is 5.

Input

The first line of the input file contains n --- the size of the array, and m --- the number of questions to answer (1 <= n <= 100 000, 1 <= m <= 5 000).
The second line contains n different integer numbers not exceeding 109 by their absolute values --- the array for which the answers should be given.
The following m lines contain question descriptions, each description consists of three numbers: i, j, and k (1 <= i <= j <= n, 1 <= k <= j - i + 1) and represents the question Q(i, j, k).

Output

For each question output the answer to it --- the k-th number in sorted a[i...j] segment.

Sample Input

7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3

Sample Output

5
6
3

#include <cstdio>
#include <algorithm>
using namespace std;

struct node
{
int n, no;
};
node num[1000000 + 5];

int cmp(node a, node b)
{
return a.n < b.n;
}

int main()
{
int m, n;
scanf("%d%d", &m, &n);
for (int i = 0; i < m; ++i)
{
scanf("%d", &num[i].n);
num[i].no = i;
}
sort(num, num+m, cmp);
for (int i = 0; i < n; ++i)
{
int from, to, sym;
scanf("%d%d%d", &from, &to, &sym);
from--;
to--;
for (int j = 0; j < m; ++j)
{
if (num[j].no >= from && num[j].no <= to)
sym--;
if (sym == 0)
{
printf("%d\n", num[j].n);
break;
}
}
}
return 0;
}


#### POJ 2104 K-th Number (线段树)

2016-05-03 10:19:34

#### poj 2104 K-th Number 主席树+超级详细解释

2016-11-02 21:45:12

#### POJ2104 K-th Number 题解&代码

2015-12-21 21:43:49

#### poj 2104 K-th Number (分桶法和平方分割)

2017-03-12 17:12:29

#### poj2104K-th Number （主席树）

2016-05-17 20:58:20

#### POJ 2104 K-th Number(区间第k大数)（平方分割，归并树，划分树）

2015-08-25 10:56:54

#### POJ 2104 K-th Number【整体二分 + 树状数组】

2016-04-29 01:09:02

#### poj 2104 K-th Number - 经典划分树

2015-07-08 18:40:05

#### poj2104 k-th number 主席树入门讲解

2017-02-03 21:21:12

#### poj2104 分桶法与平方分割 还有一些其他的感悟

2013-11-04 23:56:38