提交记录

#include<bits/stdc++.h>
#define RG register
#define IL inline
using namespace std;
const int maxn = 200005;
IL long long Read();
int n,ans;
long long lst;
struct node{
	long long l,r;
}a[maxn];
bool cmp(node x,node y){
	if(x.r == y.r) return x.l < y.l;
	return x.r < y.r;
}
int main(){
	scanf("%d",&n);
	for(int i = 1;i <= n;++i){
		a[i].l = Read();
		a[i].r = a[i].l + Read();	
	}
	sort(a + 1,a + n + 1,cmp);
	lst = a[1].l; ans++;
	for(int i = 2;i <= n;++i){
		long long nlst = max(lst + 1,a[i].l);
		if(nlst >= a[i].l && nlst <= a[i].r){
			lst = nlst;
			ans++;
		}
	}
	printf("%d",ans);
	return 0;
}
IL long long Read(){
	char c(getchar());
	long long x(0),f(1);
	while(c < '0' || c > '9'){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}