// 冒泡排序
int a[10] = {};
cin >> a;
for (i==0;i<9;i++)
{
for(j==0;j<10-i;j++)
{
if (a[j] > a[j+1])
{
int t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
// 选择排序
int b[10] = {};
cin >> b;
int max = 0 ;
for (i==0; i<9;i++)
{
max = i;
for (j= i+1 ; j<10;j++)
{
if(b[j] >b[max])
{
max = j;
}
if (j != max)
{
int t = a[max];
a[max] = a[j];
a[j] = t;
}
}
}
// 插入排序
int c[10] ={};
int i = 0;
int j = 0;
int temp = 0 ;
cin >> c;
for (i==1;i<10;i++)
{
int temp = c[i]
for (j = i-1;j>=0 && c[j]>temp;j--)
{
c[j+1] = c[j];
}
c[j+1] = temp;
}