Codeforces Round #390 (Div. 2//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 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 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.

先按左端点对这些区间排序，然后用优先队列找符合条件且最合适的右端点

这个题应该有很多种做法， 看完题后第一想法是二分，但想了半天不知道怎么check。。最后搜了题解看网上的二分是枚举左端点然后对右端点二分，还要用树状数组维护=。=

想不出来二分，有想过排序加优先队列，但感觉每次出队出最小元素不是最优解，后来想通了，举几个例子，画一画就好了，其实就是对于每个区间，找别的区间里找左端点符合条件的区间（符合条件是指左端点比我小，在我左边），再从这些区间里找最大的右端点，对左端点排完序后，符合条件的其实也就是我前面的那些区间，通过维护一个长度为k的优先队列，找到那个最大。

#include<stdio.h>
#include<algorithm>
#include<functional>
#include<queue>
using namespace std;
struct node
{
	int le,ri,num;
}nn[300005],ans;
struct cmp1
{
	bool operator()(int &a,int &b)
	{
		return a>b;
	}	
};
int cmp(node u,node v)
{
	return u.le<v.le;
}
int main()
{
	int n,k,i,maxx,t,j;
	priority_queue<int,vector<int>,cmp1>q;
	scanf("%d %d",&n,&k);
	for(i=0;i<n;i++)
	{
		scanf("%d %d",&nn[i].le,&nn[i].ri);
		nn[i].num=i+1;
	}
	sort(nn,nn+n,cmp);
	for(i=0;i<k;i++)
	{
		q.push(nn[i].ri);
	}
	maxx=q.top()-nn[k-1].le;
	ans.le=nn[k-1].le;
	ans.ri=q.top();
	for(i=k;i<n;i++)
	{
		q.pop();
		q.push(nn[i].ri);
		t=q.top()-nn[i].le;
		if(t>maxx)
		{
			maxx=t;
			ans.le=nn[i].le;
			ans.ri=q.top();
		}
	}
	//输出部分 
	if(maxx>=0)
	{
		printf("%d\n",maxx+1);
		for(i=0,j=0;i<n;i++)
		{
			if(j==k)
			break;
			if(nn[i].le<=ans.le&&nn[i].ri>=ans.ri)
			{
				printf("%d ",nn[i].num);
				j++;
			}
		}
		printf("\n");
	}
	else
	{
		printf("0\n");
		for(i=1;i<=k;i++)
		printf("%d ",i);
		printf("\n");
	}
	return 0;
}