First finding which number has the largest 1st digit
(like 546,60 ,output is 6) then swaping this number with a[0]
and then sort(a+1,a+n) and then printing array
#include
#include
using namespace std;
int number(int a[],int n)
{
int i,md=0,k,temp,rem,max=0;
for(i=0;i<n;i++)
{
temp=a[i];
if(md>max)
{
max=md;
k=i-1;
}
while(temp!=0)
{
rem=temp%10;
if(rem!=0)
{
md=rem;
}
temp=temp/10;
}
}
swap(a[0],a[k]);
sort(a+1,a+n);
return md;
}
int main() {
int i,t,j;
cin>>t;
for(j=0;j<t;j++)
{
int n,p;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
p=number(a,n);
cout<<p;
}
return 0;
}