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;
int main(){
int n; cin >> n;
pair<int, int> a[n];
for(int i = 0; i < n; i++){
int x, y; cin >> x >> y;
a[i] = make_pair(x - y, -x - y);
}
sort(a, a + n);
int ans = 0, tmp = 0;
for(int i = 0; i < n; i++){
if(tmp > a[i].second){
tmp = a[i].second; ans++;
}
}
cout << ans << '\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... |