# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256361 | Osama_Alkhodairy | Exhibition (JOI19_ho_t2) | C++17 | 92 ms | 4600 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;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, m;
vector <pair <int, int> > a;
vector <int> b;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
a.resize(n);
for(auto &i : a) cin >> i.second >> i.first;
b.resize(m);
for(auto &i : b) cin >> i;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int ans = 0;
int l = n - 1, r = m - 1;
while(l >= 0 && r >= 0){
if(b[r] >= a[l].second){
ans++;
l--;
r--;
}
else l--;
}
cout << ans << endl;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |