# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670453 | berr | Exhibition (JOI19_ho_t2) | C++17 | 1 ms | 212 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
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m; cin>>n>>m;
vector<int> c(m);
vector<array<int, 2>> a(n);
for(int i = 0; i < n; i++){
cin >> a[i][0] >> a[i][1];
}
for(int i = 0; i < m; i++){
cin>>c[i];
}
sort(a.begin(), a.end());
sort(c.begin(), c.end());
int s=0;
for(int i=20; i>=0; i--){
int tmp= s + (1<<i);
if(tmp<=m){
vector<array<int, 2>> t(tmp);
for(int i=0; i<tmp; i++){
t[i]=a[i]; swap(t[i][0], t[i][1]);
}
sort(t.begin(), t.end());
int flag=1;
int l=0;
for(int i=m-tmp; i<m; i++)
{
if(t[l][1]>c[i]) flag=0; l++;
}
if(flag) s=tmp;
}
}
cout<<s;
}
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... |