Cod sursa(job #1014651)
Utilizator | Data | 22 octombrie 2013 23:08:42 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int main()
{
long int j,n,i,k;
long int v[3000003];
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n; i++)
{
for(j=i+1; j<=n; j++)
if(v[i]>v[j])
{
v[i]=v[i]+v[j];
v[j]=v[i]-v[j];
v[i]=v[i]-v[j];
}
}
g<<v[k];
return 0;
}