# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
971545 |
2024-04-28T20:05:07 Z |
andro |
Exhibition (JOI19_ho_t2) |
C++14 |
|
0 ms |
344 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<pair<int,int>> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i].second >> a[i].first;
}
sort(a.begin() + 1, a.end());
vector<int> b(m + 1);
for(int i = 1; i <= m; i++) {
cin >> b[i];
}
int x = n;
int y = m;
int ans = 0;
while(x > 0 && y > 0) {
if(b[y] >= a[x].second) {
ans += 1;
y -= 1;
}
x -= 1;
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |