Submission #997040

#TimeUsernameProblemLanguageResultExecution timeMemory
997040mnieplowiczAdvertisement 2 (JOI23_ho_t2)C++17
100 / 100
129 ms13956 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(0);
	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] = {x - e, x + e};
	}
	sort(v.begin(), v.end(), [](pair<int, int> x, pair<int, int> y){
		if(x.first < y.first) return true;
		if(x.first > y.first) return false;
		if(x.second > y.second) return true;
		return false;
	});
	int l = 0, x = -1e9;
	for(auto i : v){
		if(i.second > x) l++, x = i.second;
	}
	cout << l << '\n';	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...