제출 #730915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730915		stevancv	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	173 ms	6640 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e5 + 2;
const int inf = 2e9 + 2;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&] (int i, int j) {
        if (x[i] + y[i] == x[j] + y[j]) return y[i] - x[i] > y[j] - x[j];
        return x[i] + y[i] > x[j] + y[j];
    });
    int mx = -inf;
    int ans = 0;
    for (int i : ord) if (y[i] - x[i] > mx) {
        mx = y[i] - x[i];
        ans += 1;
    }
    cout << ans << en;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31