CodeForces - 754D

最新推荐文章于 2024-10-05 20:01:36 发布

weixin_30708329

最新推荐文章于 2024-10-05 20:01:36 发布

阅读量71

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/Tokisaki-Kurumi-/p/7895895.html

版权

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 n discount coupons, the i-th of them can be used with products with ids ranging from l_i to r_i, inclusive. Today Fedor wants to take exactly k coupons 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 x is 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·10⁵) — the number of coupons Fedor has, and the number of coupons he wants to choose.

Each of the next n lines contains two integers l_i and r_i ( - 10⁹ ≤ l_i ≤ r_i ≤ 10⁹) — 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 p₁, p₂, ..., p_k (1 ≤ p_i ≤ n) — the ids of the coupons which Fedor should choose.

If there are multiple answers, print any of them.

Example

Input

Output

31
1 2

Input

Output

0
1 2

Input

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个，使得其交集最大

题解：排序左边界，枚举之，再创建一个k大小的右边界队列，维护其队首为最大能取的右边界。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 300005;
struct node{
    int a,b;
    int s;

    friend bool operator < (node x,node y){
        return x.b > y.b;
    }
}k[maxn];
bool cmp(node x,node y){
    return x.a < y.a;
}

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        scanf("%d%d",&k[i].a,&k[i].b);
        k[i].s=i+1;
    }

    priority_queue<node> q;
    sort(k,k+n,cmp);

    int ans = 0;

    int l = 0;
    for(int i=0;i<n;i++){

        q.push(k[i]);
        if(q.size()>m)
        q.pop();
        int left = k[i].a;
        int right = q.top().b;

        if(right - left + 1 > ans  && q.size() == m){
            l = left;
            ans = right - left + 1;
        }
    }

    cout<<ans<<endl;
    if(ans!=0)
        for(int i=0;i<n && m;i++){
            if(l>=k[i].a && ans+l-1<=k[i].b){
                cout<<k[i].s<<" ";
                m--;
            }
        }
    else
        for(int i=0;i<m;i++)
            cout<<i+1<<" ";

    return 0;
}