Submission #791974

#	Time	Username	Problem	Language	Result	Execution time	Memory
791974		Theo830	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	132 ms	18012 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    ll maxi = 0;
    ll ans = 0;
    vector<ii>ex;
    f(i,0,n){
        ll a,b;
        cin>>a>>b;
        ex.pb(ii(a - b,- a- b));
    }
    sort(all(ex));
    for(auto x:ex){
        if(maxi < -x.S){
            maxi = -x.S;
            ans++;
        }
    }
    cout<<ans<<"\n";
}

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