Submission #765550

#TimeUsernameProblemLanguageResultExecution timeMemory
765550NK_Exhibition (JOI19_ho_t2)C++17
0 / 100
1 ms324 KiB
// Success consists of going from failure to failure without loss of enthusiasm #include <bits/stdc++.h> using namespace std; #define nl '\n' template<class T> using V = vector<T>; int main() { cin.tie(0)->sync_with_stdio(0); int N, M; cin >> N >> M; V<array<int, 2>> A(N); for(auto& x : A) cin >> x[1] >> x[0]; V<int> MX(M); for(auto& x : MX) { cin >> x; x = -x; } sort(rbegin(A), rend(A)); sort(begin(MX), end(MX)); // for(auto x : A) cout << x[0] << " " << x[1] << endl; V<int> dp; for(int i = 0; i < N; i++) { int x = -A[i][1]; int pos = upper_bound(begin(dp), end(dp), x) - begin(dp); if (pos >= M) continue; if (x < MX[pos]) continue; if (pos < int(size(dp))) dp[pos] = x; else dp.push_back(x); // cout << x << " " << pos << endl; } cout << size(dp) << nl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...