# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129377 | 2019-07-12T07:30:15 Z | hungcung | Exhibition (JOI19_ho_t2) | C++17 | 2 ms | 380 KB |
#include<bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; int n,m,c[100005],dem,ans; pair<int,int> a[100005]; bool cmp(pair<int,int> &x,pair<int,int> &y){ return x.se<y.se; } signed main(){ scanf("%lld %lld",&n,&m); for(int i=0;i<n;i++){ scanf("%lld %lld",&a[i].fi,&a[i].se); } for(int i=0;i<m;i++){ scanf("%lld",&c[i]); } sort(a,a+n,cmp); sort(c,c+m); dem=n-1; for(int i=m-1;i>=0;i--){ while(dem>=0&&a[dem].fi>c[i]){ --dem; } if(dem>=0){ ++ans; --dem; } } printf("%lld",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 380 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 380 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 380 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |