Cod sursa(job #885171)
| Utilizator | Data | 21 februarie 2013 18:13:52 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
using namespace std;
int select_modificat(int k, int n, int M[100])
{
int min, p, i, j, aux;
//crescator
for(i=1;i<=k;i++)
{
min = M[i];
p = i;
for(j=i+1;j<=n;j++)
if(M[j] < min)
{
min = M[j];
p = j;
}
aux = M[i];
M[i] = min;
M[p] = aux;
}
return M[k];
}
int main ()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k, M[100];
fin >> n >> k;
for(int i=1;i<=n;i++)
fin >> M[i];
fout << select_modificat(k, n, M);
}
