Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- ifstream fin ("cerc3.in");
- ofstream fout ("cerc3.out");
- struct cerc{
- int dreapta;
- int stanga;
- };
- cerc v[1000];
- bool comp(cerc a, cerc b)
- {
- return a.dreapta < b.dreapta;
- }
- int main()
- {
- int n, i, x, y;
- fin >> n;
- for(i = 0; i < n; i++)
- {
- fin >> x >> y;
- v[i].dreapta = x + y;
- v[i].stanga = x - y;
- }
- sort(v, v + n, comp);
- int k = 1;
- int capat = v[0].dreapta;
- for(i = 1; i < n; i++)
- {
- if(v[i].stanga > capat)
- {
- k++;
- capat = v[i].dreapta;
- }
- }
- fout << k << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement