/*
    Converted from Scratch by scratch2cpp (https://github.com/yos1up/scratch2cpp).
*/
#include <iostream>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define debug cerr << "--" << __LINE__ << "--" << "\n"
typedef long long ll;
using namespace std;

const double EPS = 1e-8;

/*
static int roundToLL(double x){
    return (x < 0) ? -(ll)(-x + 0.5) : (ll)(x + 0.5);
}
*/

class Var{ // NOTE: immutable
public:
    string sval;
    double dval;
    enum VarType {STRING = 0, NUMBER = 1};
    VarType type;
    enum NumericState {UNKNOWN = -1, STRINGY = 0, NUMERIC = 1};
    mutable NumericState numericState;

    Var(){sval = ""; type = STRING; numericState = STRINGY;} // represent null?
    Var(string s){
        sval = s; type = STRING; numericState = UNKNOWN;
    }
    Var(double d){dval = d; type = NUMBER; numericState = NUMERIC;}
    Var(const Var &v){
        sval = string(v.sval); dval = v.dval;
        type = v.type; numericState = v.numericState;
    }
    static bool isNumericString(const string &s) {
        char* ep;
        //cause side-effect: errno can be ERANGE after calling strtod
        strtod(s.c_str(), &ep);
        //Scratch 3.0 recognize the string cause underflows or overflows as Numeric
        return NULL != ep && '\0' == ep[0] && s[0] != '\0';
        // TODO: In Scratch '000' is regarded as non-numeric (but here regarded as numeric)
    }
    bool isNumeric() const{
        if (type == NUMBER) return true;
        if (numericState != UNKNOWN) return numericState == NUMERIC;
        bool numeric = isNumericString(sval);
        numericState = (numeric) ? NUMERIC : STRINGY;
        return numeric;
    }
    double asNumber() const{
        if (type == NUMBER) return dval;
        return (isNumeric()) ? atof(sval.c_str()) : 0.0;
    }
    static bool isNearInteger(const double &x){
        return fabs(round(x) - x) < EPS;
        // TODO: allow integer type in Var class
    }
    static bool isNearNumber(const double &x, const double &y){
        return fabs(x - y) < EPS;
    }
    string asString() const{
        if (type == STRING) return sval;
        if (isNearInteger(dval)) return to_string((ll)round(dval));
        return to_string(dval);
    }
    Var operator+(const Var &y) const{
        return Var(this->asNumber() + y.asNumber());
    }
    Var operator+=(const Var &y){
        *this = *this + y;
        return *this;
    }
    Var operator-(const Var &y) const{
        return Var(this->asNumber() - y.asNumber());
    }
    Var operator*(const Var &y) const{
        return Var(this->asNumber() * y.asNumber());
    }
    Var operator/(const Var &y) const{
        return Var(this->asNumber() / y.asNumber());
    }
    Var operator%(const Var &y) const{
        return Var(fmod(this->asNumber(), y.asNumber()));
    }
    bool operator<(const Var &y) const{
        if (this->isNumeric() && y.isNumeric()){
            return this->asNumber() < y.asNumber();
        }// compare as number if both can be interpreted as numeric
        return this->asString() < y.asString();
    }
    bool operator>(const Var &y) const{
        return y < *this;
    }
    bool operator==(const Var &y) const{
        if (this->isNumeric() && y.isNumeric()){
            return this->asNumber() == y.asNumber();
        }// compare as numeric if both are numeric
        return this->asString() == y.asString();
    }
    friend ostream& operator << (ostream& os, const Var& p);
    friend istream& operator >> (istream& is, const Var& p);
};
ostream& operator << (ostream& os, const Var& p){
    os << p.asString();
    return os;
}
istream& operator >> (istream& is, Var& p){
    string s; is >> s; p = Var(s);
    return is;
}

Var letterOf(Var index, Var sourceString){
    /* index: 1-origined */
    string str = sourceString.asString();
    int idx = (int)(index.asNumber() - 1);
    // seem to be dirty but Scratch seems to do like this.
    // ex. letterOf(0.01, "world") == "w", letterOf(1.99, "world") == "w", letterOf(5.99, "world") == "d"
    if (0 <= idx && idx < str.size()) return Var(str.substr(idx, 1));
    return Var();
}

class VarList{
public:
    vector<Var> data;
    VarList(const vector<Var> &x) { data = x; }
    void push_back(const Var &x){ data.push_back(x); }
    void pop_back(){ data.pop_back(); }
    void clear(){ data.clear(); }
    int size(){ return (int) data.size(); }
    Var getLineOfList(const Var &index) const{
        /* index: 1-origined */
        int idx = (int)index.asNumber() - 1;
        // (unlike 'letterOf', index==0.9 does not work.)
        if (0 <= idx && idx < data.size()) return data[idx];
        return Var();
    }
    void setLineOfListTo(const Var &index, const Var &v){
        /* index: 1-origined */
        int idx = (int)index.asNumber() - 1;
        if (0 <= idx && idx < data.size()) data[idx] = v;
    }
    void deleteLineOfList(const Var &index){
        /* index: 1-origined */
        string kwd = index.asString();
        if (kwd == "all"){
            data.clear();
        }else if (kwd == "last"){
            data.pop_back();
        }else{
            int idx = (int)index.asNumber() - 1;
            if (0 <= idx && idx < data.size()) data.erase(data.begin() + idx);
        }
    }
    void insertAtIndexOfList(const Var &item, const Var &index){
        /* index: 1-origined */
        int idx = (int)index.asNumber() - 1;
        if (0 <= idx && idx <= data.size()) data.insert(data.begin() + idx, item);   
    }
    void insertAtRandomOfList(const Var &item){
        int idx = rand() % (data.size() + 1);
        data.insert(data.begin() + idx, item);
    }
    string asString() const{
        /* concatenate elements of list with space */
        // TODO: concatenated without spaces only if all elements are single characters.
        // (Is it an official bug? (or feature?))
        string ret;
        for(int i=0;i<data.size();i++){
            if (i > 0) ret += ' ';
            ret += data[i].asString();
        }
        return ret;        
    }
    int itemNumOfList(const Var &item) const{
        auto itr = find(data.begin(), data.end(), item);
        if (itr == data.end()) return 0;
        return 1 + (int)(itr - data.begin());
        /* index: 1-origined */
    }
    friend ostream& operator << (ostream& os, const VarList& p);
};
ostream& operator << (ostream& os, const VarList& p){
    os << p.asString();
    return os;
}

double randUniform(double x, double y){
    if (x > y) return randUniform(y, x);
    if (Var::isNearInteger(x) && Var::isNearInteger(y)){
        ll xi = (ll)round(x), yi = (ll)round(y);
        return xi + rand() % (yi - xi + 1);
    }else{
        return x + (y - x) * (0.0 + rand()) / RAND_MAX;
    }
}

Var buf_answer; // for "answer"

// ============================= Scripts =============================

// variable declaration
Var var_n(3);
Var var_div(4);
Var var_seg(5);
Var var_fb(1);
Var var_k(4);
Var var_sb(3);
Var var_fe(3);
Var var_se(4);
Var var_i(2);
Var var_j(4);
Var var_p(4);
Var var_N(3);
Var var_M(2);
Var var_ans(5);
Var var_buy(4);

// list declaration
VarList list_tmp({Var(1), Var(1), Var(1)});
VarList list_ary({Var(1), Var(1), Var(1)});
VarList list_A({});
VarList list_B({Var(3), Var(4), Var(5)});
VarList list_ary__idx({Var(1), Var(2), Var(3)});
VarList list_tmp__idx({Var(1), Var(2), Var(3)});

// prototype declaration of functions
int func_merge__sort__ary();
int main();

// contents of functions
int func_merge__sort__ary(){
    var_n = Var(list_ary.size());
    list_tmp.deleteLineOfList(Var("all"));
    list_tmp__idx.deleteLineOfList(Var("all"));
    list_ary__idx.deleteLineOfList(Var("all"));
    var_i = Var(1);
    for (int ovcyhbyt=0;ovcyhbyt<var_n.asNumber();ovcyhbyt++){
        list_ary__idx.push_back(var_i);
        list_tmp.push_back(Var(0));
        list_tmp__idx.push_back(Var(0));
        var_i += Var(1);
    }
    var_n += Var(1);
    var_div = Var(1);
    while (!(!(var_div < var_n))){
        var_seg = Var(1);
        while (!(!(var_seg < var_n))){
            var_fb = var_seg;
            var_k = var_seg;
            if ((((var_fb + var_div) < var_n) || ((var_fb + var_div) == var_n))){
                var_sb = (var_fb + var_div);
                var_fe = (var_fb + var_div);
            } else {
                var_sb = var_n;
                var_fe = var_n;
            }
            if ((((var_sb + var_div) < var_n) || ((var_sb + var_div) == var_n))){
                var_se = (var_sb + var_div);
            } else {
                var_se = var_n;
            }
            var_i = var_fb;
            var_j = var_sb;
            while (!(!((var_i < var_fe) && (var_j < var_se)))){
                if (((list_ary.getLineOfList(var_i) < list_ary.getLineOfList(var_j)) || (list_ary.getLineOfList(var_i) == list_ary.getLineOfList(var_j)))){
                    list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
                    list_tmp__idx.setLineOfListTo(var_k, list_ary__idx.getLineOfList(var_i));
                    var_i += Var(1);
                } else {
                    list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
                    list_tmp__idx.setLineOfListTo(var_k, list_ary__idx.getLineOfList(var_j));
                    var_j += Var(1);
                }
                var_k += Var(1);
            }
            while (!(!(var_i < var_fe))){
                list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_i));
                list_tmp__idx.setLineOfListTo(var_k, list_ary__idx.getLineOfList(var_i));
                var_k += Var(1);
                var_i += Var(1);
            }
            while (!(!(var_j < var_se))){
                list_tmp.setLineOfListTo(var_k, list_ary.getLineOfList(var_j));
                list_tmp__idx.setLineOfListTo(var_k, list_ary__idx.getLineOfList(var_j));
                var_k += Var(1);
                var_j += Var(1);
            }
            var_p = var_seg;
            while (!(!(var_p < var_k))){
                list_ary.setLineOfListTo(var_p, list_tmp.getLineOfList(var_p));
                list_ary__idx.setLineOfListTo(var_p, list_tmp__idx.getLineOfList(var_p));
                var_p += Var(1);
            }
            var_seg = (var_seg + (var_div * Var(2)));
        }
        var_div = (var_div * Var(2));
    }
    var_n += Var(-1);
    return 0;
}

int main(){
    list_ary.clear();
    list_A.clear();
    list_B.clear();
    cin >> buf_answer;
    var_N = buf_answer;
    cin >> buf_answer;
    var_M = buf_answer;
    for (int omeyytke=0;omeyytke<var_N.asNumber();omeyytke++){
        cin >> buf_answer;
        list_ary.push_back(buf_answer);
        cin >> buf_answer;
        list_B.push_back(buf_answer);
    }
    func_merge__sort__ary();
    var_ans = Var(0);
    var_i = Var(1);
    for (int klfrylvl=0;klfrylvl<var_N.asNumber();klfrylvl++){
        var_buy = list_B.getLineOfList(list_ary__idx.getLineOfList(var_i));
        if ((var_buy < var_M)){
            var_ans += (list_ary.getLineOfList(var_i) * var_buy);
            var_M += (Var(0) - var_buy);
        } else {
            var_ans += (list_ary.getLineOfList(var_i) * var_M);
            cout << var_ans << endl;
            return 0;
        }
        var_i += Var(1);
    }
    return 0;
}

                                                

Measured memory_bytes: 34936