C :

#include<stdio.h>
int main()
{
	long n[3];
	int i, j, k;
	long t;
	long max, min;
	for (i = 0; i < 3; i++)
	{
		scanf("%ld", &n[i]);
	}
	max = min = n[0];
	for (j = 0; j < 3; j++)
	{
		if (n[j] > max)
			max = n[j];
	}
	for (k = 0; k < 3; k++)
	{
		if (n[k] < min)
			min = n[k];
	}
	printf("%ld %ld\n", max, min);
	return 0;
}

Pascal :

var i,j,k,m,n:longint;
 begin
    read(i,j,k);
    if (i>j) and (i>k) then write(i,' ') else if j>k then write(j,' ') else write(k,' ');
    if (i<j) and (i<k) then write(i) else if j<k then write(j) else write(k);  
     end.