# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83636 | Leonardo_Paes | Kralj (COCI16_kralj) | C++11 | 297 ms | 4668 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;
#define MAXN 500100
int d[MAXN], e[MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n, a, resp=0;
cin >> n;
for(int i=1; i<=n; i++){
cin >> a;
}
for(int i=1; i<=n; i++){
cin>>d[i];
}
for(int i=1; i<=n; i++){
cin>>e[i];
}
sort(d+1, d+n+1);
sort(e+1, e+n+1);
for(int i=1, j=1; i<=n; i++){
if(e[i]>d[j]){
resp++;
j++;
continue;
}
}
cout << resp << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |