Submission #8503338

---

Source Code Expand

  //shan61916
#include <bits/stdc++.h>
  using namespace std;
typedef   long long ll;
typedef   unsigned long long ull ;
typedef   double dll ;

#define   mp make_pair
#define   pb push_back
#define   ff first 
#define   ss second
#define   IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define   endl "\n" 
#define   pll pair<ll, ll>
#define   all(x) x.begin(), x.end()
#define   vll vector<ll> 
const ll inf = (ll)(1e9);
vector<pll> a;
ll n;
ll dp[3001][3001];

ll recurse(ll idx, ll rem) {
  if(idx == n or rem <= 0) return 0;
  ll &ans = dp[idx][rem]; 
  if(ans != -1) return ans;
  ans = 0;
  ans = a[idx].ss + recurse(idx + 1, rem - a[idx].ff);
  ans = max(ans, recurse(idx+1, rem));
  return ans;
}
int main(){
 IOS
#ifdef SHAN
    freopen("input.txt" , "r" , stdin);  
#endif
  ll t;
  cin >> n >> t;
  a.resize(n);
  for(ll i = 0; i < n; i++) {
    cin >> a[i].ff >> a[i].ss;
  }
  sort(all(a));
  memset(dp, -1, sizeof dp);
  ll ans = -inf;
  for(ll i = 0; i < n; i++) {
    ans = max(ans, a[i].ss + recurse(i+1, t - a[i].ff));
  }
  cout << ans << endl;
  return 0;
} //good night.

Submission Info

Judge Result