# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83602 | luciocf | Kralj (COCI16_kralj) | C++14 | 944 ms | 113544 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>
using namespace std;
const int maxn = 5e5+10;
int a[maxn], p[maxn], v[maxn];
int main(void)
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> p[i];
for (int i = 1; i <= n; i++)
cin >> v[i];
sort(p+1, p+n+1);
sort(v+1, v+n+1);
int atual = 1, ans = 0;
for (int i = 1; i <= n; i++)
{
while (v[atual] < p[i] && atual < n) atual++;
if (v[atual] > p[i]) atual++, ans++;
else break;
}
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |