using namespace std;
int g_index;
void InsertSort(int a[],int n)
{
for (int i = 1;i < n;++i)
{
int v= a[i];
int j = i;
while ((a[j-1] > v)&&(j > 0))
{
a[j] = a[j-1];
j--;
}
if (a[j] != v)
{
a[j] = v;
}
}
}
void insert(int a[],int aElement)
{
a[g_index++] = aElement;
InsertSort(a, g_index)
}
int deleteElement(int a[])
{
return a[--g_index];
}
void show(int a[])
{
for (int i = 0;i < g_index; ++i)
{
cout<<a[i]<<" ";
}
}