CodeForces - 754D Fedor and coupons (优先队列)

最新推荐文章于 2019-03-20 16:50:34 发布

墨碎江南

最新推荐文章于 2019-03-20 16:50:34 发布

阅读量188

点赞数

分类专栏： dhkj

本文链接：https://blog.csdn.net/dsaghjkye/article/details/79732150

版权

dhkj 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

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.

解：题意是找出k个优惠劵最大的重合部分，我们可以先按左边界由小到大排序，然后依次存入优先队列，当到达k个时计算重叠部分，然后在加入新的优惠劵队列中数量达到k+1时把右边界最小的弹出，再次计算重叠部分如果大于最大值，更新；

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;
#define inf 0x3f3f3f3f
int n,k;
struct node
{
    int l,r,num;
    friend bool operator <(node n1,node n2)//优先队列
    {
        return n2.r<n1.r;
    }
}aa[400000];
int cmp1(node n1,node n2)
{
    return n1.num<n2.num;
}
int cmp(node n1,node n2)
{
   if(n1.l==n2.l)
    return n1.r<n2.r;
   return n1.l<n2.l;
}
int main()
{
    scanf("%d%d",&n,&k);
    int l,r,ans=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&aa[i].l,&aa[i].r);
        aa[i].num=i;
    }
    sort(aa+1,aa+1+n,cmp);
    priority_queue<node>q;
    for(int i=1;i<=n;i++)
    {
        int len=0;
        q.push(aa[i]);
        if(q.size()>k)//大于k个 弹出最小右边界的优惠劵
           q.pop();
        if(q.size()==k)
          len=q.top().r-aa[i].l+1;//计算重合部分，最小右边界 — 最大左边界
          if(ans<len)
          {
              ans=len;
              l=aa[i].l;
              r=q.top().r;
          }

    }
    printf("%d\n",ans);
    if(ans==0)
    {
        for(int i=1;i<=k;i++)
            printf("%d ",i);
    }
    else
    {
        sort(aa+1,aa+1+n,cmp1);
        for(int i=1,j=k;i<=n,j>0;i++)
        {
            if(aa[i].l<=l&&aa[i].r>=r)
            {
                printf("%d ",i);
                j--;
            }
        }
    }
    printf("\n");
}