# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97616 | 2019-02-17T13:48:49 Z | maruii | Exhibition (JOI19_ho_t2) | C++14 | 3 ms | 384 KB |
#include <bits/stdc++.h> using namespace std; using pii = pair<int, int>; int N, M, C[100000], cnt; pii A[100000], lis[100000]; int main(){ scanf("%d%d",&N,&M); for(int i=0; i<N; ++i) scanf("%d%d",&A[i].first,&A[i].second); for(int i=0; i<M; ++i) scanf("%d",C+i); sort(C, C+M), sort(A, A+N); for(int i=0; i<N; ++i){ int t = upper_bound(lis, lis+cnt, A[i], [&](pii a, pii b){return a.second<b.second;})-lis; if(cnt==t) lis[cnt++] = A[i]; else lis[t] = A[i]; } int ans=0; for(int i=0; i<M && ans<N; ++i) if(C[i]>=lis[ans].first) ++ans; printf("%d",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Incorrect | 2 ms | 256 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Incorrect | 2 ms | 256 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Incorrect | 2 ms | 256 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |