C++ :

#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,d,e,max,min;
	cin>>a>>b>>c>>d>>e;
	max=a;
	if(b>max)max=b;
	if(c>max)max=c;
	if(d>max)max=d;
	if(e>max)max=d;
	min=a;
	if(b<min)min=b;
	if(c<min)min=c;
	if(d<min)min=d;
	if(e<min)min=e;
	cout<<max<<" "<<min<<endl;
	return 0;
}

Pascal :

var a:array[1..5] of longint;
i,min,max:longint;
begin
for i:=1 to 5 do
read(a[i]);
max:=0;
min:=maxlongint;
for i:=1 to 5 do
begin
if a[i]>max then max:=a[i];
if a[i]<min then min:=a[i];
end;
write(max,' ',min);
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int[] a = new int[5];
		for(int i=0;i<5;i++){
			a[i] = sc.nextInt();
		}
		int max = a[0];
		int min = a[0];
		for(int i=0;i<5;i++){
			if(max < a[i]){
				max = a[i];
			}if(min > a[i]){
				min = a[i];
			}
		}
		System.out.println(max + " " + min);
	}

}