#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
  int n, t = 0;
  cin >> n;

  vector<pair<int, int> > p(n);
  for (int i = 0; i < n; i++) cin >> p[i].second >> p[i].first;
  sort(p.begin(), p.end());

  for (int i = 0; i < n; i++) {
    t += p[i].second;
    if (t > p[i].first) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}