제출 #1173578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173578		nguyenkhangninh99	Exhibition (JOI19_ho_t2)	C++17	100 / 100	32 ms	2632 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int maxn = 1e5 + 5;

struct l0301{
    int s, v;
} buctranh[maxn];

bool cmp(l0301 x, l0301 y){
    if(x.v == y.v) return x.s > y.s;
    return (x.v > y.v);
    
}
int c[maxn];

void solve(){
    int n, m; cin >> n >> m;

    for(int i = 1; i <= n; i++) cin >> buctranh[i].s >> buctranh[i].v;
    for(int i = 1; i <= m; i++) cin >> c[i];

    sort(buctranh + 1, buctranh + n + 1, cmp);
    sort(c + 1, c + m + 1, greater<int>());

    int i = 1, j = 1, ans = 0;
    while(i <= n && j <= m){
        if(c[j] >= buctranh[i].s) ans++, j++;
        i++;
    }

    cout << ans;
}
 
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    solve();
}

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