Submission #209199

#	Time	Username	Problem	Language	Result	Execution time	Memory
209199		ffao	Exhibition (JOI19_ho_t2)	C++14	100 / 100	90 ms	4552 KiB

joi2019_ho_t2

#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <memory.h>
#include <cmath>
#include <array>

using namespace std;

void re(int& x);

template<class T, class... Ts> void re(T& t, Ts&... ts);

void pr(int x);

void pr(const char *x);

void ps();
template<class T, class... Ts> void ps(const T& t, const Ts&... ts);

#ifdef FFDBG

#else
#define dbg(x...) dsfdsfsdfasd
#endif

void re(int& x) { scanf("%d", &x); }

template<class T, class... Ts> void re(T& t, Ts&... ts) { 
    re(t); re(ts...); 
}

void pr(int x) { printf("%d", x); }

void pr(const char *x) { printf("%s", x); }

void ps() { pr("\n"); }
template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
    pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
}

typedef pair<int, int> pii;

#define rep(i, a, b) for(int i = a; i < (b); ++i)

int n,m;
pii pictures[110000];
int frames[110000];

void solve()
{
    re(n,m);
    rep(i,0,n) re(pictures[i].second, pictures[i].first);
    rep(i,0,m) re(frames[i]);

    sort(pictures,pictures+n,greater<pii>());
    sort(frames,frames+m,greater<int>());

    int curf = 0;
    rep(i,0,n) if (curf < m && pictures[i].second <= frames[curf]) curf++;
    ps(curf);
}

int main() {

    solve();
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'void re(int&)':
joi2019_ho_t2.cpp:32:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 void re(int& x) { scanf("%d", &x); }
                   ~~~~~^~~~~~~~~~

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