Submission #641857

#	Time	Username	Problem	Language	Result	Execution time	Memory
641857		danikoynov	Exhibition (JOI19_ho_t2)	C++14	0 / 100	1 ms	212 KiB

joi2019_ho_t2

/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10;

struct picture
{
    int s, v;
}p[maxn];

bool cmp(picture p1, picture p2)
{
    if (p1.v < p2.v)
    return true;
    if (p1.v > p2.v)
        return false;
    return p1.s < p2.s;
}

int n, m, c[maxn], dp[maxn];

void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
    {
        cin >> p[i].s >> p[i].v;
    }

    for (int i = 1; i <= m; i ++)
        cin >> c[i];


    sort(c + 1, c + m + 1);
    sort(p + 1, p + n + 1, cmp);
    ///cout << check(2) << endl;
    ///return;

    int to = 0;
    for (int i = 1; i <= n; i ++)
    {
        int lf = 1, rf = to;
        while(lf <= rf)
        {
            int mf = (lf + rf) / 2;
            if (dp[mf] <= p[i].s)
                lf = mf + 1;
            else
                rf = mf - 1;
        }
        dp[lf] = p[i].s;
        if (lf > to)
            to = lf;
    }

    ll ans = 0;
    for (int f = 1; f <= to; f ++)
    {
        bool tf = true;
        for (int i = 1; i <= f; i ++)
        {

            if (dp[i] > c[(m - f) + i])
            {
                tf = false;
                break;
            }
        }

        if (!tf)
            continue;
        ans = max(ans, (ll)f);

    }
    cout << ans << endl;


}

int main()
{
    solve();
    return 0;
}

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