Submission #8480451

---

Source Code Expand

#include <cmath>
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>

int main(){
  long long N,T;
  std::cin >> N >> T;
  std::vector<std::tuple<long long, long long>> AB_arr;
  for(int i = 0; i < N; i++){
    long long A,B;
    std::cin >> A >> B;
    AB_arr.emplace_back(A,B);
  }

  std::sort(AB_arr.begin(), AB_arr.end());

  long long dp[3001][3001] = {};

  for(int i = 0; i < N; i++){
    long long A,B;
    std::tie(A,B) = AB_arr[i];
    for(int j = 0; j < T; j++){
      if(j-A < 0){
        dp[i+1][j] = dp[i][j];
      }else{
        dp[i+1][j] = std::max(dp[i][j], B+dp[i][j-A]);
      }
    }
  }

  long long tmax = dp[N][T-1];
  long long bmax = 0;
  for(int i = N-1; i >= 0; i--){
    bmax = std::max(bmax, std::get<1>(AB_arr[i]));
    tmax = std::max(tmax, dp[i][T-1]+bmax);
  }

  std::cout << tmax << std::endl;

  return 0;
}

Submission Info

Judge Result