Cod sursa(job #1800789)
| Utilizator | Data | 8 noiembrie 2016 08:53:31 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[3000001],n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
void citire()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>x[i];
}
void sortare()
{
int aux=0,i;
int t=0;
while(t==0)
{
t=1;
for(i=1;i<n;i++)
if(x[i]>x[i+1])
{
aux=x[i];
x[i]=x[i+1];
x[i+1]=aux;
}
}
}
int main()
{
citire();
sortare;
g<<x[k];
return 0;
}
