P2014 选课

//#define local
#include<cstdio>
#include<iostream>
#include<vector>
#define MAXN 305
using namespace std;
typedef long long ll;
int max(const int &a,const int &b){
	return a>b?a:b;
}
int n,m;
int w[MAXN]; 
vector<int>e[MAXN];
int dp[MAXN][MAXN]={0};
void dfs(int cur){
	if(!e[cur].size()){
		return;
	}
	else{
		for(int i=0;i<e[cur].size();++i){
			int next=e[cur][i];
			dfs(next);
			for(int j=m+1;j>=2;--j){
				for(int k=1;k<=j-1;++k){
					dp[cur][j]=max(dp[cur][j-k]+dp[next][k],dp[cur][j]);
				}
			}
		}
	}
}
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
scanf("%d%d",&n,&m);
w[0]=0;
for(int i=1;i<=n;++i){
	int k,s;
	scanf("%d%d",&k,&s);
	w[i]=s;
	e[k].push_back(i);
	dp[i][1]=w[i];
}
dfs(0);
cout<<dp[0][m+1];
return 0;
}