hdu 4314 Save the dwarfs

又是一个i写成j了，找了好久才发现

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 2011;

struct zz
{
	int x;
	int y;
	bool operator < (const zz & cmp) const
	{
		return x+y<cmp.x+cmp.y;
	}
}zx;

int dp[maxn][maxn];
int f[maxn];
int n,h;
vector<zz>v;


int start()
{
	for(int i=0;i<=n;i++)
	{
		dp[i][0]=0;
	}
	int temp;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=i;j++)
		{
			temp = v[i].x+v[i].y;
			dp[i][j]=min(max(dp[i-1][j-1],h-f[i-1]-temp),max(dp[i-1][j]-v[i].x,0));						
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{	
		if(!dp[n][i])
		{
			ans=i;
		}
	}
	return ans;
}

int main()
{
	while(cin>>n)
	{
		v.clear();
		for(int i=0;i<=n;i++)
		{
			for(int j=0;j<=n;j++)
			{
				dp[i][j]=inf;
			}	
		}
		MM(f,0);
		for(int i=1;i<=n;i++)
		{
			cin>>zx.x>>zx.y;	
			v.pb(zx);
		}			
		cin>>h;
		zx.x=zx.y=inf;
		v.pb(zx);
		sort(v.begin(),v.end());
		reverse(v.begin(),v.end());
		for(int i=1;i<=n;i++)
		{
			f[i]=f[i-1]+v[i].x;	
		}
		cout<<start()<<endl;
	}
    return 0;
}