답안 #888074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888074 2023-12-15T22:44:57 Z Maite_Morale Exhibition (JOI19_ho_t2) C++14
0 / 100
1 ms 2396 KB
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 500005
#define oo 1e18
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll t,n,b[MAX],m;
pll a[MAX];
int main(){
    fast_in
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>a[i].S>>a[i].F;a[i].F*=-1;
    }
    for(int i=0;i<n;i++){
        cin>>b[i];
    }sort(b,b+m);sort(a,a+n);
    ll h=m-1,r=0;
    for(int i=0;i<n;i++){
        if(b[h]>=a[i].S){
            r++;h--;
            if(h==-1)break;
        }
    }
    cout<<r;
return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 1 ms 2392 KB Output isn't correct
4 Halted 0 ms 0 KB -