# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153941 | tsengang | Advertisement 2 (JOI23_ho_t2) | C++17 | 0 ms | 328 KiB |
#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;
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;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |