cf 754D Fedor and coupons

一 原题

D. Fedor and coupons

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

All our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.

The goods in the supermarket have unique integer ids. Also, for every integer there is a product with id equal to this integer. Fedor has ndiscount coupons, the i-th of them can be used with products with ids ranging from li to ri, inclusive. Today Fedor wants to take exactly kcoupons with him.

Fedor wants to choose the k coupons in such a way that the number of such products x that all coupons can be used with this product xis as large as possible (for better understanding, see examples). Fedor wants to save his time as well, so he asks you to choose coupons for him. Help Fedor!

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 3·105) — the number of coupons Fedor has, and the number of coupons he wants to choose.

Each of the next n lines contains two integers li and ri ( - 109 ≤ li ≤ ri ≤ 109) — the description of the i-th coupon. The coupons can be equal.

Output

In the first line print single integer — the maximum number of products with which all the chosen coupons can be used. The products with which at least one coupon cannot be used shouldn't be counted.

In the second line print k distinct integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the ids of the coupons which Fedor should choose.

If there are multiple answers, print any of them.

Examples

input

4 2
1 100
40 70
120 130
125 180

output

31
1 2 

input

3 2
1 12
15 20
25 30

output

0
1 2 

input

5 2
1 10
5 15
14 50
30 70
99 100

output

21
3 4 

Note

In the first example if we take the first two coupons then all the products with ids in range [40, 70] can be bought with both coupons. There are 31 products in total.

In the second example, no product can be bought with two coupons, that is why the answer is 0. Fedor can choose any two coupons in this example.

二 分析

题意是给定n个区间，要求找出其中的k个，使得区间交集长度最大。

用[x, y]表示一个区间的话，如果已经确定k个区间里最大的x值，那么只需要最大化k个区间y的最小值就行了。

首先对n个区间按照x排序，这样每次新取的区间的x就是目前最大的x值。

维护一个最小堆，堆中只存放k个区间，每次加入新的区间时，就把y值最小的那个区间pop掉。这样堆顶元素的y就是最大化的y最小值。

三 代码

AC代码：

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

int n, m;
int ans, L, R;
struct Seg {
    int l, r;
    int idx;
    bool operator < (const Seg &obj) const {
        return l < obj.l;
    }
};
vector<Seg> segs;
priority_queue<int, vector<int>, greater<int>> q;

Seg seg(int _l, int _r, int _idx) {
    Seg ret;
    ret.l = _l;
    ret.r = _r;
    ret.idx = _idx;
    return ret;
}

int main() {
    scanf("%d%d", &n, &m);
    int _l, _r;
    for(int i = 0; i < n; i++) {
        scanf("%d%d", &_l, &_r);
        segs.push_back(seg(_l, _r, i + 1));       
    }   
    sort(segs.begin(), segs.end());
    for(int i = 0; i < n; i++) {
        q.push(segs[i].r);
        if(q.size() > m) q.pop();
        if(q.size() == m) {
            int candidate = q.top() - segs[i].l + 1;
            if(candidate > ans) {
                ans = candidate;
                L = segs[i].l;
                R = q.top();
            }
        }
    }
    printf("%d\n", ans);
    if(ans == 0) {
        for(int i = 1; i <= m; i++)
            printf("%d ", i);
    }
    else {
        for(int i = 0; i < n && m > 0; i++) {
            if(segs[i].l <= L && segs[i].r >= R) {
                printf("%d ", segs[i].idx);
                m--;
            }
        }
    }
    printf("\n");
    return 0;
}