Solution to Buying Hay (hay)

hay.cpp

#include <iostream>
#include <cstring>

using namespace std;

int DP[50010];

int main() {
  int N, H;
  cin >> N >> H;

  memset(DP, 0x3F, sizeof(DP));
  for(int i = DP[0] = 0; i < N; i++) {
    int P, C; cin >> P >> C;
    for(int i = 1; i <= H; i++) {
      DP[i] = min(DP[i], C + DP[max(0, i - P)]);
    }
  }

  cout << DP[H] << endl;
  return 0;
}