提出 #512645

---

ソースコード 拡げる

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <tuple>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<vector<PII> > VVPII;
typedef priority_queue<PII, vector<PII>, greater<PII> > PQPII;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int DX[] = {0, 1, 0, -1};
const int DY[] = {-1, 0, 1, 0};

//other
//--------------------------------------------
#define RANGE(a, c, b) ((a <= b) && (b < c))

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main(int argc, char const *argv[])
{
  LL N, T;
  cin >> N >> T;
  VI A(N), B(N);
  REP(i, N){
    cin >> A[i] >> B[i];
  }
  vector<vector<LL>> dp(N + 1, vector<LL>(N, -1));
  dp[0][0] = 0;
  REP(i, N){
    REP(j, i + 1){
      if(dp[i][j] < 0) continue;

      // 写さなかった場合
      if(dp[i + 1][j] >= 0){
        dp[i + 1][j] = min(dp[i][j] + A[i], dp[i + 1][j]);
      }else{
        dp[i + 1][j] = dp[i][j] + A[i];
      }

      // 写した場合
      if(dp[i + 1][j + 1] >= 0){
        dp[i + 1][j + 1] = min(dp[i][j] + B[i], dp[i + 1][j + 1]);
      }else{
        dp[i + 1][j + 1] = dp[i][j] + B[i];
      }

    }
  }
  int res = -1;
  REP(i, N){
    if(dp[N][i] <= T){
      res = i;
      break;
    }
  }
  cout << res << endl;
  return 0;
}

提出情報

ジャッジ結果