Haybale Feast

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <iomanip>
#include <regex>
#include <numeric>
using namespace std;
#define pii pair<long long , long long>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long MAX = 100005;
const long long MOD = 1000000009;

long long n, f;
long long flavor[MAX], spicy[MAX];

int main() {
    freopen("hayfeast.in", "r", stdin);
    freopen("hayfeast.out", "w", stdout);
    FAST;
    cin >> n >> f;
    for(long long i = 0; i < n; i++){
        cin >> flavor[i] >> spicy[i];
    }
    multiset<long long> ms;
    ms.insert(spicy[0]);
    long long sum = flavor[0];
    long long hi = 0;
    long long ans = 2e9;
    for(long long lo = 0; lo < n; lo++){
        while(sum < f){
            if(hi == n - 1){
                break;
            }
            hi++;
            sum += flavor[hi];
            ms.insert(spicy[hi]);
        }
        auto it = ms.end();
        it--;
        if(sum >= f){
            ans = min(ans, *it);
        }
        sum -= flavor[lo];
        ms.erase(ms.find(spicy[lo]));
    }
    cout << ans;

}
// 5 10
//4 10
//6 15
//3 5
//4 9
//3 6