#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int N = 500000 + 3;
int n, a[N], p[N], v[N];
multiset <int> ms;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif // LOCAL
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n; i++) {
int x;
cin >> x;
ms.insert(x);
}
ms.insert(inf);
int ans =0 ;
for (int i = 0; i < n; i++){
if (*ms.lower_bound(p[i]) != inf){
ms.erase(ms.lower_bound(p[i]));
ans++;
}else{
ms.erase(ms.begin());
}
}
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
810 ms |
22372 KB |
Output is correct |
2 |
Correct |
438 ms |
21880 KB |
Output is correct |
3 |
Correct |
621 ms |
27128 KB |
Output is correct |
4 |
Correct |
687 ms |
28024 KB |
Output is correct |
5 |
Incorrect |
1071 ms |
25208 KB |
Output isn't correct |
6 |
Incorrect |
620 ms |
25080 KB |
Output isn't correct |
7 |
Incorrect |
1002 ms |
26212 KB |
Output isn't correct |
8 |
Incorrect |
762 ms |
23672 KB |
Output isn't correct |
9 |
Incorrect |
1242 ms |
27876 KB |
Output isn't correct |
10 |
Incorrect |
940 ms |
27864 KB |
Output isn't correct |