This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; ++i) {
int x, e;
cin >> x >> e;
v[i] = make_pair(e - x, e + x);
}
sort(v.begin(), v.end());
vector<int> st;
for (int i = 0; i < n; ++i) {
while (!st.empty() && v[i].second >= st.back()) {
st.pop_back();
}
st.push_back(v[i].second);
}
cout << st.size() << "\n";
return 0;
}
# | 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... |