Submission #83602

#TimeUsernameProblemLanguageResultExecution timeMemory
83602luciocfKralj (COCI16_kralj)C++14
56 / 140
944 ms113544 KiB
#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 timeMemoryGrader output
Fetching results...