Submission #1091211

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091211		TrinhKhanhDung	Exhibition (JOI19_ho_t2)	C++14	100 / 100	44 ms	4540 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
#define double long double

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1e5 + 10;

int N, M;
pair<int, int> picture[MAX];
int frame[MAX];

void solve(){
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> picture[i].se >> picture[i].fi;
    }
    for(int i = 1; i <= M; i++) cin >> frame[i];

    sort(picture + 1, picture + N + 1, greater<pair<int, int>>());
    sort(frame + 1, frame + M + 1, greater<int>());

    int ans = 0;
    for(int i = 1, j = 1; i <= M; i++){
        while(j <= N && picture[j].se > frame[i]) j++;
        if(j > N) break;
        j++;
        ans++;
    }

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("mst.inp","r",stdin);
//     freopen("mst.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

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