제출 #1284481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284481		zagaro	Exhibition (JOI19_ho_t2)	C++20	100 / 100	36 ms	2860 KiB

joi2019_ho_t2

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, m, r=0, p;
    cin>>n>>m;
    vector<pair<ll,ll> > vec(n+1);
    for(int i=1;i<=n;i++)cin>>vec[i].second>>vec[i].first;
    vector<ll> vic(m+1);
    for(int i=1;i<=m;i++)cin>>vic[i];
    sort(vec.begin(), vec.end());
    sort(vic.begin(), vic.end());
    p=m;
    for(int i=n;i>=1 && p>=1;i--){
        if(vec[i].second <= vic[p]){
            r++;
            p--;
        }
    }
    cout<<r<<ENDL;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50