# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
911429 |
2024-01-18T22:34:08 Z |
andro |
Exhibition (JOI19_ho_t2) |
C++14 |
|
1 ms |
352 KB |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<pair<int,int>> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
}
vector<int> b(m + 1);
for(int i = 1; i <= m; i++) {
cin >> b[i];
}
// vel b rastujuce ide
// a[i].second takodje rastujuce uzimam
sort(b.begin() + 1, b.end());
sort(a.begin() + 1, a.end());
vector<int> dp(n + 1);
for(int i = 1; i <= n; i++) {
dp[i] = 1;
}
for(int i = 1; i <= n; i++) {
for(int j = i - 1; j > 0; j--) {
if(a[i].second <= a[j].second) {
dp[i] = max(dp[j] + 1, dp[i]);
}
}
}
int ans = 0;
for(int i = 1; i <= m; i++) {
int idx = 0;
for(int j = 1; j <= n; j++) {
if(a[j].first <= b[i]) {
ans = max(ans, min(dp[j], i));
}
}
}
cout << ans;
}
Compilation message
joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:39:13: warning: unused variable 'idx' [-Wunused-variable]
39 | int idx = 0;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
352 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |