#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

int main(){
    int n, t = 0;
    long double w, v = 0;
    std::cin >> n >> w;
    std::vector<std::pair<int, long double>> ms(n);
    for (std::pair<int, long double> &m : ms) std::cin >> m.second >> m.first;
    std::sort(ms.begin(), ms.end());
    for (std::pair<int, long double> &m : ms){
        if (v*(2*m.first-t) >= w) break;
        w -= v*(2*m.first-t);
        t = 2*m.first;
        v += m.second;
    }
    std::cout << t+w/v << std::endl;
    return 0;
}