# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551990 | wenqi | Exhibition (JOI19_ho_t2) | C++17 | 69 ms | 4908 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// trans rights
#include <bits/extc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#ifdef DEBUG
#define D(...) fprintf(stderr, __VA_ARGS__)
#else
#define D(...)
#endif
int N, M;
int main(int argc, const char *argv[])
{
scanf("%d%d", &N, &M);
vector<pair<int, int>> pics;
vector<int> frames;
for (int i = 0; i < N; i++)
{
int a, b;
scanf("%d%d", &a, &b);
pics.push_back({b, a});
}
for (int i = 0; i < M; i++)
{
int a;
scanf("%d", &a);
frames.push_back(a);
}
sort(pics.begin(), pics.end());
sort(frames.begin(), frames.end());
int u = M - 1;
for (int i = N - 1; i >= 0; i--)
{
if (u >= 0 and frames[u] >= pics[i].second)
u--;
}
printf("%d\n", M - 1 - u);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |