import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } long lcm(long x, long y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void main() { auto N = RD; auto K = RD; auto PD = new long[][](N); foreach (i; 0..N) { PD[i] = [RD, RD]; } PD.sort!"a[0] > b[0]"(); auto pos = new long[](N); { long best, p; foreach_reverse (i; 0..N) { if (PD[i][1] > best) { best = PD[i][1]; p = i; } pos[i] = p+1; } } auto dp = new long[][](N+1, K+1); foreach (i; 0..N+1) dp[i][] = -1; dp[0][K] = 0; foreach (i; 0..N) { foreach (key; 0..K+1) { if (dp[i][key] == -1) continue; if (key >= PD[i][0]) { auto nKey = key - PD[i][0]; auto value = dp[i][key] + PD[i][1]; dp[i+1][nKey].chmax(value); foreach (j; i+1..pos[i+1]) { dp[j+1][nKey].chmax(value + PD[j][1]); } } dp[i+1][key].chmax(dp[i][key]); } } debug writeln(dp); long ans; foreach (key; 0..K+1) ans.chmax(dp[N][key]); writeln(ans); stdout.flush; debug readln; }