class Solution {
public int[] relativeSortArray(int[] arr1, int[] arr2) {
int b=0;
int c=0;
for(int aaa=0;aaa<arr2.length;aaa++){
for(int aa=0;aa<arr1.length;aa++){
if(arr2[aaa]==arr1[aa]){
b++;
}
}
if(b>=2){
c++;
}
b=0;
}
int ban[][]=new int[arr2.length][2];
int sss=0;
for(int s=0;s<arr2.length;s++){
for(int ss=0;ss<arr1.length;ss++){
if(arr2[s]==arr1[ss]){
sss++;
}
}
ban[s][0]=arr2[s];
ban[s][1]=sss;
sss=0;
}
int a=0;
int[] rest=new int[arr1.length];
int d=0;
for(int i=0;i<arr1.length;i++){
for(int ii=0;ii<arr2.length;ii++){
if (arr2[ii]!=arr1[i]){
a++;
}
}
if(a==arr2.length){
rest[d]=arr1[i];
d++;
}
a=0;
}
Arrays.sort(rest);
int[] back=new int[arr1.length];
int p=0;
for(int r=0;r<arr2.length;r++){
for(;ban[r][1]>0;ban[r][1]--){
back[p]=ban[r][0];
p++;
}
}
for(int o=0;p<back.length;o++){
if(rest[o]==0){
continue;
}
back[p]=rest[o];
p++;
}
return back;
}
}