| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1342197 | Nipphitch | Exhibition (JOI19_ho_t2) | C++20 | 35 ms | 1552 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m,b[N],ans;
pair <int,int> a[N];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for(int i=1;i<=n;i++) cin >> a[i].second >> a[i].first;
sort(a+1,a+1+n,greater <pair <int,int>>());
for(int i=1;i<=m;i++) cin >> b[i];
sort(b+1,b+1+m,greater <int>());
for(int i=1,j=1;i<=n && j<=m;){
if(a[i].second<=b[j]){
ans++;
i++,j++;
}
else if(a[i].second>b[j]) i++;
}
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... | ||||
