제출 #798836

#제출 시각아이디문제언어결과실행 시간메모리
798836vjudge1Advertisement 2 (JOI23_ho_t2)C++17
100 / 100
330 ms14152 KiB
#include <bits/stdc++.h>

#define fi first
#define se second

const int N = 200200;
const int mod = 1e9 + 7;

using namespace std;

int main() {
    #ifdef zxc
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int n;
    cin >> n;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        a[i] = {x - y, - x - y};
    }
    sort(a.rbegin(), a.rend());
    vector<pair<int, int>> v;
    for (auto p: a) {
        while (!v.empty() && p.se <= v.back().se) {
            v.pop_back();
        }
        v.push_back(p);
    }

    cout << v.size() << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...