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>
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 5e5 ;
int n ;
pair<int, int> p[N + 1] ;
vector<pair<int, int>> abu ;
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    for(int i = 1 ; i <= n ; i++)
        cin >> p[i].fi >> p[i].se ;
    sort(p + 1, p + n + 1) ;
    for(int i = 1 ; i <= n ; i++)
    {
        if(abu.size() && p[i].fi - abu.back().fi <= abu.back().se - p[i].se)
            continue ;
        while(abu.size() && p[i].fi - abu.back().fi <= p[i].se - abu.back().se)
            abu.pop_back() ;
        abu.push_back(p[i]) ;
    }
    cout << abu.size() ;
    return 0 ;
}
| # | 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... |