#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define int long long
/*
For 40% points:
To the current dwarf, assign the weakest elf who can
defeat him. If no one can, assign the weakest.
For 60% points:
Merge small-to-large.
*/
int32_t main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> p(n), a(n), v(n);
multiset<int> s;
for (int i = 0; i < n; ++i) {
cin >> a[i];
--a[i];
assert(a[i] == 0); // 40pts solution
}
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> v[i], s.insert(v[i]);
int ans = 0;
for (int i = 0; i < n; ++i) {
auto it = s.lower_bound(p[i]);
if (it == s.end()) {
s.erase(s.begin());
} else {
s.erase(it);
ans++;
}
}
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
811 ms |
37080 KB |
Output is correct |
2 |
Correct |
464 ms |
35780 KB |
Output is correct |
3 |
Correct |
641 ms |
44420 KB |
Output is correct |
4 |
Correct |
642 ms |
45156 KB |
Output is correct |
5 |
Runtime error |
20 ms |
22092 KB |
Execution killed with signal 6 |
6 |
Runtime error |
20 ms |
22008 KB |
Execution killed with signal 6 |
7 |
Runtime error |
21 ms |
22976 KB |
Execution killed with signal 6 |
8 |
Runtime error |
18 ms |
20704 KB |
Execution killed with signal 6 |
9 |
Runtime error |
24 ms |
24244 KB |
Execution killed with signal 6 |
10 |
Runtime error |
22 ms |
24268 KB |
Execution killed with signal 6 |