# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158820 | wjliangtpe | Exhibition (JOI19_ho_t2) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define oo 10000000000000001
int n,m,c[200005];
int v[200005],s[200005],srtv[200005],seqv[200005],seqs[200005],seq[200005],pos,ans;
signed main(){
ios::sync_with_stdio(0),cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>s[i]>>v[i];
srtv[i]=-v[i];
}
for(int i=1;i<=m;i++){
cin>>c[i];
c[i]=-c[i];
}
sort(c+1,c+m+1),sort(srtv+1,srtv+n+1);
for(int i=1;i<=n;i++){
seqs[i]=upper_bound(c+1,c+m+1,-s[i])-c-1;
}
for(int i=1;i<=n;i++){
seqv[i]=upper_bound(srtv+1,srtv+n+1,-v[i])-srtv-1;
seq[i]=min(seqv[i],seqs[i]);
}
sort(seq+1,seq+n+1);
reverse(seq+1,seq+n+1);
pos=100000000;
ans=0;
for(int i=1;i<=n;i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |