Submission #1212463

#TimeUsernameProblemLanguageResultExecution timeMemory
1212463VMaksimoski008Advertisement 2 (JOI23_ho_t2)C++17
100 / 100
261 ms6376 KiB
#include <bits/stdc++.h> using namespace std; signed main() { int n; cin >> n; vector<pair<int, int> > v(n); for(int i=0; i<n; i++) { int a, b; cin >> a >> b; v[i] = { a - b, a + b }; } sort(v.begin(), v.end(), [&](auto a, auto b) { if(a.first != b.first) return (a.first > b.first); return a.second < b.second; }); stack<int> st; for(int i=0; i<n; i++) { while(!st.empty() && st.top() <= v[i].second) st.pop(); st.push(v[i].second); } cout << st.size() << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...