C :

#include<stdio.h>
void main()
{
    int n,i,j,t,k,a[99999];
    scanf("%d%d",&n,&k);
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    for(i=0;i<n;i++)
    for(j=i+1;j<n;j++)
    if(a[i]>a[j])
    {

        t=a[i];
        a[i]=a[j];
        a[j]=t;

    }printf("%d",a[0]); 
    for(i=1;i<k;i++)
    printf(" %d",a[i]);
}

C++ :

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

vector<int> p;

int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	for (int i = 0; i < n; i++) {
		int x;
		scanf("%d", &x);
		p.push_back(x);
	}
	sort(p.begin(), p.end());
	for (int i = 0; i < k; i++) {
		if (i) printf(" ");
		printf("%d", p[i]);
	}	
	return 0;
}

Pascal :

var n,k,i,j,t:longint;
    a:array[1..10000] of longint;
begin
  read(n,k);
  for i:=1 to n do
    read(a[i]);
  for i:=1 to n-1 do
    for j:=1 to n-i do
      if a[j]>a[j+1] then
      begin
        t:=a[j];
        a[j]:=a[j+1];
        a[j+1]:=t;
      end;
  for i:=1 to k-1 do
    write(a[i],' ');
  writeln(a[k]);
end.

Java :

import java.util.*;

public class Main {
	public static void main (String[] args) {
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		int k=in.nextInt();
		int []a=new int[n];
		for(int i=0;i<n;i++){
			a[i]=in.nextInt();
		}	
		java.util.Arrays.sort(a);
		int c=0;
		for(int j=0;j<k;j++){
			c++;
			if(c%k==0)
				System.out.println (a[j]);
			else
				System.out.print (a[j]+" ");
		}
	}
}