Submission #888406

#	Time	Username	Problem	Language	Result	Execution time	Memory
888406		hafo	Exhibition (JOI19_ho_t2)	C++14	0 / 100	1 ms	2396 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, m, c[maxn];
pa a[maxn];

bool cmp(pa a, pa b) {
    return a.se > b.se;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m;
    for(int i = 1; i <= n; i++) cin>>a[i].fi>>a[i].se;
    for(int i = 0; i < m; i++) cin>>c[i];

    sort(a + 1, a + 1 + n, cmp);
    sort(c, c + m, greater<int>());
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        if(c[ans] >= a[i].fi) ans++;
    }
    cout<<ans;
    return 0;
}

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