# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136762 | hamzqq9 | Exhibition (JOI19_ho_t2) | C++14 | 76 ms | 4472 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ii pair<int,int>
#define ll long long
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define orta ((bas+son)>>1)
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define inf 2000000000
#define N 100005
#define MOD 998244353
using namespace std;
int c[N];
ii p[N];
int main() {
int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++) {
scanf("%d %d",&p[i].nd,&p[i].st);
}
sort(p+1,p+1+n);
for(int i=1;i<=m;i++) {
scanf("%d",c+i);
}
sort(c+1,c+1+m,greater<int>());
int cur=0;
for(int i=n;i>=1;i--) {
if(c[cur+1]>=p[i].nd) {
++cur;
}
}
printf("%d",cur);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |