C :

#include<stdio.h>
int main()
{
    int t,a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    if(a>b){t=a;a=b;b=t;}
    if(a>c){t=a;a=c;c=t;}
    if(b>c){t=b;b=c;c=t;}
    printf("%d %d %d ",a,b,c);
    return 0;
}

C++ :

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
    int a[3];
    cin>>a[0]>>a[1]>>a[2];
    sort(a,a+3);
    printf("%d %d %d \n",a[0],a[1],a[2]);
    return 0;
}

Pascal :

var t,a,b,c:longint;
begin
  readln(a,b,c);
  if a>b then begin t:=a; a:=b; b:=t; end;
  if a>c then begin t:=a; a:=c; c:=t; end;
  if b>c then begin t:=b; b:=c; c:=t; end;
  writeln(a,' ',b,' ',c,' ');
end.