#include <bits/stdc++.h>
using namespace std;
#define MAXN 500001
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=0; i<n; i++){
cin >> a;
if(a!=1){
return 0;
}
}
for(int i=0; i<n; i++){
cin>>d[i];
}
for(int i=0; i<n; i++){
cin>>e[i];
}
sort(d, d+n);
sort(e, e+n);
for(int i=0, j=0; i<n; i++){
if(e[i]>d[j]){
resp++;
j++;
}
}
cout << resp << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
217 ms |
3628 KB |
Output is correct |
2 |
Correct |
192 ms |
3680 KB |
Output is correct |
3 |
Correct |
256 ms |
4352 KB |
Output is correct |
4 |
Correct |
241 ms |
4480 KB |
Output is correct |
5 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
4480 KB |
Output isn't correct |