#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep1(i, n) for (int i = 1; i < n + 1; i++) #define rev(i, n) for (int i = n - 1; i >= 0; i--) #define all(A) A.begin(), A.end() #define itr(A, l, r) A.begin() + l, A.begin() + r #define debug(var) cout << #var << " = " << var << endl; typedef long long ll; template ostream &operator<<(ostream &os, const pair &p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const vector &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } template ostream &operator<<(ostream &os, const vector> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << endl; } return os; } template ostream &operator<<(ostream &os, const vector>> &v) { int n = v.size(); int m = v[0].size(); int p = v[0][0].size(); rep(k, p) { os << "k = " << k << endl; rep(i, n) { rep(j, m) { os << v[i][j][k]; if (j < m - 1) { os << " "; } else { os << endl; } } } } return os; } template istream &operator>>(istream &is, vector &v) { for (T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, map &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } cout << endl; return os; } template ostream &operator<<(ostream &os, set st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, multiset st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue, greater> mpq) { while (mpq.size()) { os << mpq.top() << " "; mpq.pop(); } return os; } #include int main() { ll n, p, k; cin >> n >> p >> k; assert(1 <= n && n <= 1000); assert(1 <= k && k <= 1000); assert(1 <= p && p <= 1e18); vector> dp(n + 1, vector(k + 1, 0)); dp[0][0] = p; rep(i, n) { ll t, b; cin >> t >> b; assert(1 <= t && t <= 2); if (t == 1) { assert(1 <= b && b <= 1e9); } else { assert(b == 0); } rep(j, k + 1) { auto chmax = [](auto &a, auto b) { a = max(a, b); }; chmax(dp[i + 1][j], dp[i][j]); if (j + 1 <= k) { if (t == 1) { chmax(dp[i + 1][j + 1], min(dp[i][j] + b, ll(1e18) + 1)); } else { chmax(dp[i + 1][j + 1], min(dp[i][j] * 2, ll(1e18) + 1)); } } } } if (dp[n][k] > ll(1e18)) { cout << -1 << endl; } else { cout << dp[n][k] << endl; } }