Vijos 1238
WA*3
#include <algorithm>
#include <stdio.h>
using namespace std;
int x[1002],y[1002],a[2004];
int main()
{
int n,m,p;
long long ans=0;
scanf("%d%d%d",&n,&m,&p);
if (p<m) m=p;
for (int i=1;i<=n;i++)
{
scanf("%d%d",&x[i],&y[i]);
a[i*2-1]=x[i];a[i*2]=y[i];
}
sort(a+1,a+2*n+1);
int num=1;
for (int i=2;i<=2*n;i++)
if (a[i]!=a[num]) a[++num]=a[i];
for (int i=1;i<=num-1;i++)
{
int k=0;
for (int j=1;j<=n;j++)
{
if (a[i]>=x[j] && a[i+1]<=y[j]) ++k;
if (a[i]>x[j] && a[i]<y[j]) ans--;
if (k>=m) break;
}
ans+=k*(a[i+1]-a[i]+1);
}
printf("%lld",ans);
return 0;
}