# 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 主席树+超级详细解释

• woshinannan741
• 2016年11月02日 21:45
• 674

## 【poj2104】K-th Number 分块

DescriptionYou are working for Macrohard company in data structures department. After failing your p...
• LOI_DQS
• 2015年09月19日 21:13
• 672

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

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 46589   Accepted: 15...
• a2459956664
• 2016年05月03日 10:19
• 2051

## poj2104K-th Number （主席树）

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 46886   Accepted: 15...
• su20145104009
• 2016年05月17日 20:58
• 4310

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

• qq_34271269
• 2017年02月03日 21:21
• 492

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

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 53887   Accepted: 18...
• bmicnj
• 2017年03月12日 17:12
• 282

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

• piaocoder
• 2015年08月25日 10:56
• 1343

## poj 2104 K-th number

Description You are working for Macrohard company in data structures department. After failing yo...
• b2utyyomi
• 2016年09月11日 12:35
• 111

## POJ 2104 . K-th Number

POJ 2104 . K-th Number DescriptionYou are working for Macrohard company in data structures departmen...
• liyizhixl
• 2017年06月27日 21:31
• 151

## poj 2104 k-th number

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 45330   Accepted: 15...
• clover_hxy
• 2016年03月06日 21:12
• 291

举报原因： 您举报文章：POJ 2104 - K-th Number 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)