Cod sursa(job #1723246)
| Utilizator | Data | 30 iunie 2016 10:24:22 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define MAX 3000001
using namespace std;
unsigned int n, k;
unsigned int a[MAX];
unsigned int var;
unsigned int i, j;
unsigned int solution;
int main ()
{
ifstream fin ("sdo.in");
fin >> n >> k;
for (i=1; i<=n; i++)
fin >> a[i];
fin.close();
for (i=1; i<=n; i++)
for (j=1; j<n; j++)
if (a[j] > a[j+1])
{
var = a[j+1];
a[j+1] = a[j];
a[j] = var;
}
solution = a[k];
ofstream fout ("sdo.out");
fout << solution;
fout.close();
return 0;
}
