# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
245739 | Vladikus004 | Kralj (COCI16_kralj) | C++14 | 1242 ms | 28024 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.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |