Why am I getting TLE for the below code?I can’t seem to optimize it further.
#include<bits/stdc++.h>
using namespace std;
int main()
{
while(1)
{
int A,D;
scanf("%d,%d",&A,&D);
if (A == 0 && D == 0)
break;
vector v1(A);
vector v2(D);
for(int i=0;i<A;i++)
{
scanf("%d",&v1[i]);
}
for(int j=0;j<D;j++)
{
scanf("%d",&v2[j]);
}
sort(v1.begin(),v1.end());
sort(v2.begin(),v2.end());
if (v1[0] < v2[1] )
printf("Y\n");
else
printf("N\n");
}
return 0;
}