90pts求调

#include<iostream>
#include<vector>

int t, m, tm[10100], val[10100];
std::vector<std::vector<long long> > dp;

signed main()
{
	std::cin >> t >> m;
	for (int i = 1; i <= m; i++)
	{
		std::cin >> tm[i] >> val[i];
	}
	dp.resize(m + 1);
	for (int i = 0; i <= m; i++)
	{
		dp[i].resize(t + 1);
	}
	for (int i = 1; i <= m; i++)
	{
		for (int j = 1; j <= t; j++)
		{
			if (tm[i] > j)
			{
				dp[i][j] = dp[i - 1][j];
				continue;
			}
			dp[i][j] = std::max(dp[i - 1][j], dp[i][j - tm[i]] + val[i]);
		}
	}
	std::cout << dp[m][t];
	return 0;
}