#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
#define ll long long
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[500005];
map<ll,ll> maa,mii,mee;
vector<ll> vj,vo,vi;
pair<ll,ll> k[500005];
int main(){
cin>>a;
for(i=0 ; i<a ; i++){
cin>>b>>c;
k[i].first=-b-c;
k[i].second=b-c;
}
sort(k,k+a);
h=0;
g=9999999999999;
for(i=0 ; i<a ; i++){
if(k[i].second<g){
h++;
g=k[i].second;
}
}
cout<<h<<endl;
}
# | 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... |