C :

#include<stdio.h>
int main()
{
	int n, i, j, k, t;
	int a[100];
	scanf("%d", &n);
	for(i=0; i<n && n>1 && n<=100; i++)
	{
		scanf("%d", &a[i]);
	}
	
	for(i=0; i<n-1; i++)//比较趟数
	{
		k = i;
		for(j=i+1; j<n; j++)
		{
			if(a[j] < a [k]) k = j;
		}

		{
			t = a[k];
			a[k] = a[i];
			a[i] = t;
		}

		
	}
	for(i=n-1,j=n-2; j>=0; j--)
	{
		if(a[i]==a[j]);

		else 
		{
			printf("%d", a[j]);
			break;
		}

	}	
	return 0;

}

C++ :

#include<stdio.h>
int main(){
	int n,i,max1,max2;
	int a[100];
	scanf("%d",&n);
	for (i=1; i<=n; i++)
	{
		scanf("%d",&a[i]);
	}	
		max1=0;
	for (i=1; i<=n; i++){
		if (a[i]>=max1)
		{max1 = a[i];}
	}
		
	for (i=1; i<=n; i++){
		if (a[i]>=max2 && a[i]!=max1)
		{max2 = a[i];}
	}
	printf("%d",max2);

	return 0;
}

Pascal :

program ngj;
var
  a:array[1..100] of integer;
  n,i,max,min:integer;
  begin
    read(n);
    for i:=1 to n do
    read(a[i]);
    max:=a[1];
    min:=a[1];
    for i:=2 to n do
    if a[i]>max then max:=a[i]
    else max:=max;
    for i:=1 to n do
    if a[i]<>max then
    begin
      if a[i]<min then min:=min
      else min:=a[i];
    end;
    writeln(min);
end.