제출 #335847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335847		sumit_kk10	Exhibition (JOI19_ho_t2)	C++14	0 / 100	1 ms	364 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
bool vis[N];

void solve(){
    long long int n, m;
    cin >> n >> m;
    pair<long long int, long long int> a[n];
    long long int b[m];
    for(int i = 0; i < n; ++i)
        cin >> a[i].second>> a[i].first;
    sort(a, a + n);
    for(int i = 0; i < m; ++i)
        cin >> b[i];
    sort(b, b + m);
    long long int ans1 = 0;
    for(int k = 0; k < n; ++k){
        for(int j = 0; j < m; ++j)
            vis[j] = 0;
        long long int ans = 0, pre = 0;
        for(int i = k; i < n; ++i){
            long long int x = a[i].second;
            for(int j = 0; j < m; ++j){
                if(b[j] >= x and vis[j] == 0 and b[j] >= pre){
                    vis[j] = 1;
                    ++ans;
                    pre = b[j];
                    break;
                }
            }
        }
        // cout << ans << '\n';
        ans1 = max(ans1, ans);
    }
    cout << ans1;
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

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