Submission #284099

#	Time	Username	Problem	Language	Result	Execution time	Memory
284099		zecookiez	Exhibition (JOI19_ho_t2)	C++14	100 / 100	63 ms	5752 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int len(const C&c){return int(c.size());}
const int MAXN = 100005;
array<long long, 2> arr[MAXN];
long long cap[MAXN];

int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("lineup.in", "r", stdin);
    //freopen("lineup.out", "w", stdout);
    int n, m, ans = 0; cin >> n >> m;
    for(int i = 0; i < n; ++i) cin >> arr[i][1] >> arr[i][0];
    sort(arr, arr + n);
    for(int i = 0; i < m; ++i) cin >> cap[i];
    sort(cap, cap + m);
    for(int a = 0, b = 0; a < n; ++a){
        if(cap[m - b - 1] >= arr[n - a - 1][1]) ++ans, ++b;
    }
    cout << ans << endl;
    return 0;
}

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