/*
                    __
                   /\ \
 _ __   ___     ___\ \ \/'\     ___      __      ___     ___      __
/\`'__\/ __`\  /'___\ \ , <    / __`\  /'__`\  /' _ `\ /' _ `\  /'__`\
\ \ \//\ \L\ \/\ \__/\ \ \\`\ /\ \L\ \/\ \L\.\_/\ \/\ \/\ \/\ \/\ \L\.\_
 \ \_\\ \____/\ \____\\ \_\ \_\ \____/\ \__/.\_\ \_\ \_\ \_\ \_\ \__/.\_\
  \/_/ \/___/  \/____/ \/_/\/_/\/___/  \/__/\/_/\/_/\/_/\/_/\/_/\/__/\/_/


*/

#ifndef __AHA__HEADER
#define __AHA__HEADER

#include <bits/stdc++.h>
using namespace std;
#define g0 get<0>
#define g1 get<1>
#define g2 get<2>
#define ft first
#define sd second
#define sz(x) (i6) x.size()
#define psb(x) push_back(x)
#define ppb() pop_back()
#define bg(x) x.begin()
#define ed(x) x.end()
#define col(x) x.begin(), x.end()
#define srt(x) sort(x.begin(), x.end())

#define pq priority_queue
#define fn function
#ifdef LOCAL
#define git stauDBG_MACRO_NO_WARNING
#include <dbg.h>
#else
#define dbg(...)
#endif
#define endl '\n'

template <typename T>
using vec = vector<T>;
template <typename T>
using deq = deque<T>;
template <typename K, typename V>
using hmap = unordered_map<K, V>;

using str = string;
using vb = vec<bool>;

using byte = int8_t;
using i3 = int32_t;
using i6 = int64_t;
using i64 = int64_t;
using u3 = uint32_t;
using u6 = uint64_t;

using d6 = long double;

using p3 = pair<i3, i3>;
using vi3 = vec<i3>;
using vp3 = vec<p3>;

using p6 = pair<i6, i6>;
using vi6 = vec<i6>;
using vd6 = vec<d6>;
using vp6 = vec<p6>;
using vv = vec<vi6>;

using dp6 = deq<p6>;
using di6 = deq<i6>;

using mi6 = map<i6, i6>;
using mp6 = map<p6, i6>;
using si6 = set<i6>;
using hi6 = hmap<i6, i6>;

using bs = bitset<64>;

using graph = vv;
using matrix = vv;

const d6 EPS = 1 / 1000000.0;
const i6 ZERO = 0;
const i6 _0 = ZERO;
const i6 ONE = 1;
const i6 _1 = ONE;
const i6 INF = INT64_MAX / 4;
const i6 NINF = -INF;

namespace std {
template <typename T1, typename T2>
struct hash<pair<T1, T2>> {
  std::size_t operator()(const pair<T1, T2>& pair) const noexcept {
    return hash<T1>()(pair.first) ^ hash<T2>()(pair.second);
  }
};
}  // namespace std

template <typename T1, typename T2>
istream& operator>>(istream& stream, pair<T1, T2>& p) {
  stream >> p.ft;
  stream >> p.sd;
  return stream;
}

template <typename T1, typename T2>
ostream& operator<<(ostream& stream, const pair<T1, T2>& p) {
  return stream << p.ft << " " << p.sd;
}

template <typename T>
istream& operator>>(istream& stream, vec<T>& v) {
  if (v.empty()) {
    u6 len;
    stream >> len;
    v.assign(len, T());
  }
  for (auto i = 0; i < sz(v); i++) {
    stream >> v[i];
  }
  return stream;
}

template <typename T>
ostream& operator<<(ostream& stream, const vec<T>& v) {
  if (!v.empty()) {
    stream << v[0];
  }
  for (auto i = 1; i < sz(v); i++) {
    stream << " " << v[i];
  }
  return stream;
}

template <typename T>
istream& operator>>(istream& stream, deq<T>& v) {
  if (v.empty()) {
    u6 len;
    stream >> len;
    v.assign(len, T());
  }
  for (auto i = 0; i < sz(v); i++) {
    stream >> v[i];
  }
  return stream;
}

template <typename T>
ostream& operator<<(ostream& stream, const deq<T>& v) {
  if (!v.empty()) {
    stream << v[0];
  }
  for (auto i = 1; i < sz(v); i++) {
    stream << " " << v[i];
  }
  return stream;
}
#endif

i64 g, e;
vector<p6> v;

// i64 solve(i64 idx, i64 sum) {
//   if (dp[idx][sum] != -2) {
//     return dp[idx][sum];
//   }

//   if (idx >= g && sum < e) {
//     return dp[idx][sum] = -1;
//   } else if (sum >= e) {
//     return dp[idx][sum] = 0;
//   }

//   i64 r1 = solve(idx + 1, sum);
//   i64 r2 = v[idx].sd + solve(idx + 1, sum + v[idx].ft);

//   if (r1 == -1) {
//     return dp[idx][sum] = r2;
//   } else if (r2 == -1) {
//     return dp[idx][sum] = r1;
//   } else {
//     return dp[idx][sum] = min(r1, r2);
//   }
// }

i64 solve2() {
  vector<vector<i64>> dp(g + 2, vi6(e + 3, -1));

  for (i64 i = 0; i < g; i++) {
    dp[i][0] = 0;
  }

  for (i64 i = 1; i <= e; i++) {
    if (v[0].ft >= i) {
      dp[0][i] = v[0].sd;
    } else {
      break;
    }
  }

  for (i64 i = 1; i < g; i++) {
    for (i64 j = 1; j <= e; j++) {
      if (v[i].ft >= j) {
        if (dp[i - 1][j] == -1) {
          dp[i][j] = v[i].sd;
        } else {
          dp[i][j] = min(dp[i - 1][j], v[i].sd);
        }
      } else {
        if (dp[i - 1][j - v[i].ft] == -1) {
          dp[i][j] = dp[i - 1][j];
        } else if (dp[i - 1][j] == -1) {
          dp[i][j] = v[i].sd + dp[i - 1][j - v[i].ft];
        } else {
          dp[i][j] = min(dp[i - 1][j], v[i].sd + dp[i - 1][j - v[i].ft]);
        }
      }
    }
  }

  return dp[g - 1][e];
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // #ifdef LOCAL
  ifstream fin{"energii.in"};
  ofstream fout{"energii.out"};
  // #endif

  fin >> g >> e;

  v.assign(g, {0, 0});
  for (i64 i = 0; i < g; i++) {
    fin >> v[i].ft >> v[i].sd;
  }

  // fout << solve(0, 0);
  fout << solve2();

  return 0;
}