//#include //using namespace atcoder; #include using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(v) v.begin(),v.end() typedef long long ll; #define int ll using vi = vector; using vs = vector; using P = pair; template bool chmax(T &a, const T b) {if (a < b) {a = b; return true;} else return false; } template bool chmin(T &a, const T b) {if (a > b) {a = b; return true;} else return false; } const int INF = 1e18; //using mint = modint1000000007; //using mint = modint998244353; signed main() { cin.tie(0); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); int n,d;cin>>n>>d; vector

can,de; rep(i,n){ int p,q; cin>>p>>q; if(p<=q)can.push_back({p,q}); de.push_back({p-q,q}); } P one,two; if(can.size()<2){ sort(all(de)); one = de[0]; two = de[1]; one.first+=one.second; two.first+=two.second; } else{ sort(all(can)); one = can[0]; two = can[1]; } //cout << one.first<<" "<