oj.uz

답안 #704048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704048 2023-03-01T13:09:48 Z 1075508020060209tc Exhibition (JOI19_ho_t2) C++14
0 / 100
 1000 ms 308 KB 
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int m;
pair<int,int>paint[500005];
int buc[500005];

int ok(int mi){
int it=m-mi+1;
for(int i=1;i<=n;i++){
    if(buc[it]>=paint[i].second){
        it++;
        if(it==m+1){return 1;}
    }
}
return 0;
}


signed main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
    cin>>paint[i].second>>paint[i].first;
}
sort(paint+1,paint+n+1);
for(int i=1;i<=m;i++){
    cin>>buc[i];
}
sort(buc+1,buc+m+1);

int l=0;int r=m;
while(l<r){
    int mi=l+(r-l)/2;
    if(ok(mi)){
        l=mi;
    }else{
        r=mi-1;
    }
}
cout<<l<<endl;


}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1073 ms 308 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1073 ms 308 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1073 ms 308 KB Time limit exceeded
3 Halted 0 ms 0 KB -