제출 #827744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
827744		CSQ31	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	137 ms	4672 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	int n;
	cin>>n;
	vector<pii>a;
	for(int i=0;i<n;i++){
		int x,e;
		cin>>x>>e;
		a.pb({e-x,e+x});
	}
	sort(all(a),greater<pii>());
	int ans = 0,thres = -2e9-1;
	for(int i=0;i<n;i++){
		if(thres >= a[i].se)continue;
		ans++;
		thres = max(thres,a[i].se);
	}
	cout<<ans;
	
	
}

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