제출 #1202118

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202118		PlayVoltz	Advertisement 2 (JOI23_ho_t2)	C++20	100 / 100	108 ms	8264 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

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

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, c=-1, ans=0;
	cin>>n;
	vector<pii> vect(n);
	for (int i=0, a, b; i<n; ++i)cin>>a>>b, vect[i]=mp(a-b, a+b);
	sort(vect.begin(), vect.end(), custom);
	for (auto a:vect)if (a.se>c)++ans, c=a.se;
	cout<<ans;
}

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