제출 #875594

#제출 시각아이디문제언어결과실행 시간메모리
875594hmm789Advertisement 2 (JOI23_ho_t2)C++14
10 / 100
138 ms29776 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353
 
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, ans = 1;
    cin >> n;
    int x[n], e[n], b[n];
    pair<int, int> a[n];
    for(int i = 0; i < n; i++) {
        cin >> x[i] >> e[i];
        a[i] = {x[i]+e[i], i};
    }
    sort(a, a+n);
    for(int i = 0; i < n; i++) {
        b[i] = x[a[i].second]-e[a[i].second];
    }
    for(int i = n-1; i >= 1; i--) {
        if(b[i-1] < b[i]) ans++;
        b[i-1] = min(b[i-1], b[i]);
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...