Submission #1153947

#TimeUsernameProblemLanguageResultExecution timeMemory
1153947tsengangAdvertisement 2 (JOI23_ho_t2)C++17
100 / 100
297 ms16060 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 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 = x[i] - e[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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...