题目

#include<bits/stdc++.h>
//#pragma GCC optimize(2,"Ofast","inline")
using namespace std;
int L,n,p[1005],k[1005],f[1005],zd=-1,wz; 
signed main(){
	cin>>L>>n;
	memset(f,1,sizeof(f));
	for(int i=1;i<=n;i++)
	{
		cin>>p[i]>>k[i];
		if(k[i]-p[i]>zd) zd=k[i]-p[i],wz=i;
	}
	printf("%d\n",wz);
	zd=-1;
	for(int i=1;i<=n;i++){
		int sum=0;
		for(int j=p[i];j<=k[i];j++)
		sum+=f[j],f[j]=0;
		if(sum>zd) zd=sum,wz=i;
	}
	printf("%d",wz);
}