codeforces D. 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 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·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张来，使得这k张的交集最大。

【解析】：

贪心+优先队列。

基本思想：扫描数轴，当有k个区间段覆盖在当前点上时，

取最小右端点，和最大左端点，作差。

这个差，就可能是答案（当然可能有更大的这样的差）

按区间左端点排序，然后依次扫描左端点，并同时将相应的右端点压入优先队列。

当队列大小是k的时候，取出队列中最小值（右端点），与当前左端点作差。

然后不断更新这个差，取最大的哪一个，即为答案。

【代码】：

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
struct node{
	ll l,r;
	int id;
}a[400000];
bool cmp(node c,node d)
{
	if(c.l==d.l)
		return c.r<d.r;
	return c.l<d.l;
}
int main()
{
	int n,k;
	priority_queue<int,vector<int>,greater<int> > q;
	while(~scanf("%d%d",&n,&k))
	{
		while(!q.empty())q.pop();
		for(int i=1;i<=n;i++)
		{
			ll s,t;
			scanf("%lld%lld",&s,&t);
			a[i].l=s;
			a[i].r=t;
			a[i].id=i;
		}
		sort(a+1,a+n+1,cmp);//时间排序
		ll maxtimelenth=-1;
		ll left=10000000000,right=-1000000000;
		for(int i=1;i<=n;i++)
		{
			q.push(a[i].r);
			if(q.size()==k)
			{
				if(maxtimelenth<q.top()-a[i].l)
				{
					maxtimelenth=q.top()-a[i].l;
					left=a[i].l;
					right=q.top();
				}
				q.pop();
			}
		}
		printf("%lld\n",maxtimelenth+1);
		int count=0;
		for(int i=1;i<=n&&count<k;i++)
		{
			if(a[i].l<=left&&a[i].r>=right)
			{
				printf("%d ",a[i].id);
				count++;
			}
		}
		printf("\n");
	}
	return 0;
}