0pts求调（壶关）

#include<bits/stdc++.h>
using namespace std;
//dp[i][j]
int n,k;
const int N=5500;
int dp[N][N];
struct node{
    int x,y;
}a[N];
bool cmp(node x,node y){
    if (x.x==y.x){
        return x.y>y.y;
    }
    else return x.x<y.x;
}
int main(){
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;++i) scanf("%d%d",&a[i].x,&a[i].y);
    sort(a+1,a+1+n,cmp);
    for (int i=1;i<=n;++i){
        dp[i][k]=1;
        for (int j=0;j<=k;++j){
            for (int t=1;t<i;++t){
                if (a[t].x>a[i].x||a[t].y>a[i].y) continue;
                int d=abs(a[i].y-a[t].y)+abs(a[i].x-a[t].x)-1;
                if (j+d>k) continue;
                dp[i][j]=max(dp[t][j+d]+d+1,dp[i][j]);
            }
        }
    }
    int ans=0;
    for (int i=0;i<=n;++i){
        for (int j=0;j<=k;++j) ans=max(dp[i][j]+j,ans);
    }
    cout<<ans;
    return 0;
}