Submission #937550

#TimeUsernameProblemLanguageResultExecution timeMemory
937550zwezdinvAdvertisement 2 (JOI23_ho_t2)C++17
100 / 100
138 ms16020 KiB
#include <bits/stdc++.h>

int main() {
        std::cin.tie(nullptr)->sync_with_stdio(false);

        int n;
        std::cin >> n;
        std::vector<int> x(n), y(n);
        for (int i = 0; i < n; ++i) {
                int a, b;
                std::cin >> a >> b;
                x[i] = -(a + b);
                y[i] = a - b;
        }
        std::vector<int> p(n);
        std::iota(p.begin(), p.end(), 0);
        std::sort(p.begin(), p.end(), [&](int i, int j) {
                if (y[i] == y[j]) {
                        return x[i] < x[j];
                }
                return y[i] < y[j];
        });
        int mn = 2e9;
        int ans = 0;
        for (auto i : p) {
                if (x[i] < mn) {
                        ans++;
                        mn = x[i];
                }
        }
        std::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...