제출 #923331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
923331		Xiaoyang	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	131 ms	18120 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (ll i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int prod(ll a,ll b) {return ll(a)*ll(b)%mod;}
int lowbit(ll x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}


bool cmp(pll a,pll b){
	if(a.fi==b.fi){
		return a.se>b.se;
	}
	return a.fi<b.fi;
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n;cin>>n;
	vector<pll>alist;
	rep(i,1,n+1){
		ll a,b;cin>>a>>b;
		alist.pb(MP(a-b,a+b));
	}
	sort(ALL(alist),cmp);
	ll mx=0,cnt=0;
	rep(i,0,n){
		if(alist[i].se>mx){
			mx=alist[i].se;
			cnt++;
		}
	}
	cout<<cnt<<endl;
	return 0;
}

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