# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715516 | Koful123 | Exhibition (JOI19_ho_t2) | C++17 | 63 ms | 5604 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 int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void solve(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> v(n);
for(auto &[x,y] : v){
cin >> x >> y;
}
sort(v.begin(),v.end(),[&](auto x,auto y){
if(x.ss != y.ss) return x.ss > y.ss;
return x.ff > y.ff;
});
vector<int> f(m);
for(int i = 0; i < m; i++){
cin >> f[i];
}
int ans = 0,p = 0,last = 0;
sort(f.rbegin(), f.rend());
for(int i = 0; i < m; i++){
while(p < n && v[p].ff > f[i]){
++p;
}
if(p != n){
++ans; ++p;
}
}
cout << ans << endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--)
solve();
return 0;
}
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... |