| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 209684 | Autoratch | Exhibition (JOI19_ho_t2) | C++14 | 85 ms | 5636 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>
using namespace std;
const int N = 1e5;
int n,m;
pair<long long,long long> a[N];
long long b[N],ans;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
for(int i = 0;i < n;i++) cin >> a[i].second >> a[i].first;
for(int i = 0;i < m;i++) cin >> b[i];
sort(a,a+n),sort(b,b+m);
int i = n-1,j = m-1;
while(i>=0 and j>=0)
{
if(b[j]>=a[i].second) ans++,i--,j--;
else 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... | ||||
