| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1325415 | exoworldgd | Exhibition (JOI19_ho_t2) | C++20 | 122 ms | 2748 KiB |
#include<bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
#define int long long
using namespace std;
int n,m,a[100005],ans,idx;
array<int,2>p[100005];
signed main(void){
cin>>n>>m,idx=m-1;
for(int i=0;i<n;i++)cin>>p[i][0]>>p[i][1];
for(int i=0;i<m;i++)cin>>a[i];
sort(p,p+n,[](auto&x,auto&y){return x[1]^y[1]?x[1]<y[1]:x[0]<y[0];}),sort(a,a+m);
for(int i=n-1;i+1;i--)if(idx+1&&p[i][0]<=a[idx])ans++,idx--;
cout<<ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
