[POI2018]Prawnicy 树状数组

Description
给定数轴上n个区间，请选择其中恰好k个区间，使得交集的长度最大。

---

Sample Input
6 3
3 8
4 12
2 6
1 10
5 9
11 12

---

Sample Output
4
1 2 4

---

你可以将x坐标排个序，每次找第k大的y值，我用的是树状数组，莫名很慢？？？
可能是我没有快输。

---

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
int read() {
	int s = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * f;
}

struct node {
	int x, y, id;
} a[1100000];
int n, b[1100000], bak[1100000];
int len, A[1100000], s[1100000];

bool cmp1(node a, node b) {
	if(a.x == b.x) return a.y < b.y;
	return a.x < b.x;
}

int lowbit(int x) {return x & -x;}
void change(int x, int c) {for(int i = x; i <= n; i += lowbit(i)) s[i] += c;}
int findkth(int k) {
	int now = 0, sum = 0;
	for(int i = 20; i >= 0; i--) {
		if(now + (1 << i) < n && sum + s[now + (1 << i)] < k) now += 1 << i, sum += s[now];
	} return now + 1;
}

int Pos(int x) {
	int l = 1, r = n, ans;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(b[mid] <= x) l = mid + 1, ans = mid;
		else r = mid - 1;
	} return ans;
}

int main() {
	n = read(); int k = read();
	for(int i = 1; i <= n; i++) a[i].x = read(), a[i].y = read(), b[i] = a[i].y, a[i].id = i;
	sort(b + 1, b + n + 1);
	for(int i = 1; i <= n; i++) {
		int u = Pos(a[i].y); bak[u] = a[i].y;
		a[i].y = u;
	}
	sort(a + 1, a + n + 1, cmp1);
	for(int i = 1; i < k; i++) change(n + 1 - a[i].y , 1);
	int ans = 0, pos, g;
	for(int i = k; i <= n; i++) {
		change(n + 1 - a[i].y, 1);
		int hh = findkth(k);
		if(bak[n + 1 - hh] - a[i].x > ans) ans = bak[n + 1 - hh] - a[i].x, pos = i, g = hh;
	} printf("%d\n", ans); int o = 0;
	for(int i = 1; i <= pos; i++) {
		if(o == k) break;
		if(n + 1 - a[i].y <= g) A[++len] = a[i].id, o++;
	} sort(A + 1, A + len + 1);
	for(int i = 1; i <= len; i++) printf("%d ", A[i]);
	return 0;
}