# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125747 | EntityIT | Exhibition (JOI19_ho_t2) | C++14 | 49 ms | 4344 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.
/*
check N = 1e5 / 1e3;
*/
#include<bits/stdc++.h>
using namespace std;
const int N = (int)1e3 + 5, M = N;
int n, m, c[M], f[M][N];
struct Picture {
int s, v;
Picture (int _s = 0, int _v = 0) : s(_s), v(_v) {}
bool operator< (const Picture &_) const { return make_pair(v, s) < make_pair(_.v, _.s); }
} picture[N];
int main () {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) {
int s, v; scanf("%d %d", &s, &v);
picture[i] = Picture(s, v);
}
sort(picture + 1, picture + n + 1);
for (int i = 1; i <= m; ++i) scanf("%d", c + i);
sort(c + 1, c + m + 1);
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
f[i][j] = max(f[i - 1][j], f[i][j - 1]);
if (c[i] >= picture[j].s) f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
}
}
printf("%d", f[m][n]);
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... |