#include <bits/stdc++.h>
using namespace std;
signed main() {
int n; cin >> n;
vector<pair<int, int> > v(n);
for(int i=0; i<n; i++) {
int a, b; cin >> a >> b;
v[i] = { a - b, a + b };
}
sort(v.begin(), v.end(), [&](auto a, auto b) {
if(a.first != b.first) return (a.first > b.first);
return a.second < b.second;
});
stack<int> st;
for(int i=0; i<n; i++) {
while(!st.empty() && st.top() <= v[i].second) st.pop();
st.push(v[i].second);
}
cout << st.size() << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |