C :

#include<stdio.h>
int main()
{
  int n,m,i,r,t;
  double s,q;
  s=0.0;
  r=0;
  i=1;
  t=100;
  scanf("%d",&m);
  while(i<=m)
  {
    scanf("%d",&n);
    if(r<=n)
    {
      r=n;
    }
    if(t>=n)
    {
      t=n;
    }
    i++;
    s=s+n;
  }
  q=s/m;
  printf("%d\n%d\n%.2lf",r,t,q);
  return 0;
}


    

C++ :

#include<stdio.h>
int main ()
{
	int n,i,score,high = 1,low = 100,sum = 0;
	double aver;
	scanf("%d ",&n);
	for(i = 1; i <= n; i ++)
	{
		scanf(" %d",&score);
		sum += score;
		aver = sum * 1.0 / n * 1.0;
		if(score > high)
		{
			high = score;	
		}
		if (score < low)
		{
			low = score;	
		}
		 
	}
	printf ("%d\n%d\n%.2lf \n",high,low,aver);
	return 0;
} 

Pascal :

var a:array [1..100] of longint;
    i,j,p,n,t:longint;
BEGIN
    read(n);
    for i:=1 to n do begin read(a[i]); inc(p,a[i]); end;
    for i:=1 to n-1 do
        for j:=i+1 to n do
        if a[i]<a[j] then
        begin  t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
    writeln(a[1]);
    writeln(a[n]);
    writeln(p/n:0:2);
END.