He is off side problem

[mido22_sof]

i solved it but it is wa i want more test cases to break my solution

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
int main()
{
    int x,y;
    cin>>x>>y;
    while(x!=0&&y!=0)
    {
     int i,j;
     int arr[x+1],arra[y+1],min=999999,mini=999999;
     for(i=0;i<x;i++)
     {
      cin>>arr[i];
      if(min>arr[i]){
      min=arr[i];
      }
     }
     for(j=0;j<y;j++)
     {
      cin>>arra[j];
      sort(&arra[0],&arra[y]);
     }
     mini=arra[1];
     //cout<<mini<<endl;
     if(mini<min&&y!=0||mini==min&&y!=0)
     {
     cout<<"N"<<endl;
     }
     else
     {
     cout<<"Y"<<endl;
     }
     cin>>x>>y;
  }
  return 0;
}

[leppyr64]

Make sure that you're only outputting the information that's supposed to be output.

[mido22_sof]

i want test case to break it so i understand if i solved it wrong

[leppyr64]

The sample test cases will cause incorrect output.

[mido22_sof]

ok i correct but it is wa also
the sample output is
N
Y
N