#include <iostream> #include <vector> #include <algorithm> using namespace std; typedef pair<int, int> pnm; int main() { int sum, n; while(cin >> sum >> n) { pnm p; vector<pnm> nm; for(int i=0; i<n; i++) { cin >> p.first >> p.second; nm.push_back(p); } sort(nm.begin(),nm.end()); int count = 0, money = 0; for(int i=0; i<n; i++) { count += nm[i].second; if(count >= sum) { money += nm[i].first * (count - sum); break; } money += nm[i].first * nm[i].second; } cout << money << endl; } return 0; }