제출 #866536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866536		goodspeed0208	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	135 ms	13392 KiB

Main

#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#define int long long
using namespace std;

bool cmp(pair<int, int> a, pair<int, int> b) {
    if (a.first == b.first) return a.second > b.second;
    return a.first < b.first;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int> >v(n);
    int a, b;
    for (int i = 0 ; i < n ; i++) {
        cin >> a >> b;
        v[i] = {a-b, a+b};
        //cout << a-b << " " << a+b << "\n";
    }
    sort(v.begin(), v.end(), cmp);
    int ans = 1, right = v[0].second;
    for (int i = 1 ; i < n ; i++) {
        if (v[i].second <= right) continue;
        ans++;
        right = v[i].second;
    }
    cout << ans << "\n";
}

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