Submission #1202115

#TimeUsernameProblemLanguageResultExecution timeMemory
1202115PlayVoltzAdvertisement 2 (JOI23_ho_t2)C++20
10 / 100
100 ms8264 KiB
#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 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()); for (auto a:vect)if (a.se>c)++ans, c=a.se; 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...