dp[i][j]:处理到第i行,刷j次所能刷去的最多垃圾数
求dp[i][j]时分两类
(1)不刷第i行,最大是dp[i][j-1]
(2)刷第i行,贪心一下,让刷子的边缘是第i行,从第i行往前扫到第一个刷不到的行数i2,扫的过程中把扫走的垃圾数记为cnt,最大是cnt+dp[i2][j-1];
dp[i][j]=max(dp[i][j-1],cnt+dp[i2][j-1])
// Created by Chenhongwei on 2016-03-31 Thursday 20:06
// Copyright (c) 2016 Chenhongwei. All rights reserved.
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#define root 1,n,1
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int inf=1e9+1;
const int mod=1e9+7;
const int maxn=1e5+100;
typedef long long ll;
typedef unsigned long long ull;
int x[300],y[300];
int dp[110][110];
int n,w,k;
int main()
{
//ios::sync_with_stdio(false);
// freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int T;
scanf("%d",&T);
for(int kase=1;kase<=T;kase++)
{
memset(dp,0,sizeof dp);
scanf("%d%d%d",&n,&w,&k);
for(int i=1;i<=n;i++)
scanf("%d%d",&x[i],&y[i]);
sort(y+1,y+n+1);
memset(dp,0,sizeof dp);
int ans=0;
for(int i=1;i<=k;i++)
for(int j=1;j<=n;j++)
{
int t=lower_bound(y+1,y+n+1,y[j]-w)-y;
t--;
dp[j][i]=max(dp[j-1][i],dp[t][i-1]+j-t);
ans=max(ans,dp[j][i]);
}
printf("Case %d: %d\n",kase,ans);
}
return 0;
}