제출 #1153940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153940		tsengang	Advertisement 2 (JOI23_ho_t2)	C++20	0 / 100	0 ms	328 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ertunt return
const int MOD = 998244353;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
int main() {
    ll n;
    cin >> n;
    ll x[n],e[n];
    pair<ll,ll> a[n];
    for(ll i = 0; i < n; i++){
        cin >> x[i] >> e[i];
        a[i].ff = e[i] - x[i];
        a[i].ss = -e[i] - x[i];
    }
    sort(a,a+n);
    ll ans = 0;
    ll cur = -1e9;
    for(ll i = 0; i < n; i++){
        a[i].ss = -a[i].ss;
        if(a[i].ss > cur){
            ans++;
            cur = a[i].ss;
        }
    }
    cout << ans;
}

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