Cod sursa(job #1759029)
Utilizator | Papa Valentin papinub2 | Data | 18 septembrie 2016 13:52:11 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k, i, j, v[3000001], iMin;
int main ()
{
in>>n>>k;
for (i=1; i<=n; i++) in>>v[i];
for (j = 1; j < n; j++)
{
int iMin = j;
for ( i = j+1; i <= n; i++)
{
if (v[i] < v[iMin])
{
iMin = i;
}
}
if(iMin != j)
{
swap(v[j], v[iMin]);
}
}
out<<v[k]; return 0;
}