Cod sursa(job #598965)
| Utilizator |  Despotovici Mihai dspMihai |
Data | 27 iunie 2011 17:13:02 |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
long crt,i,n,m;
vector <long> a;
int main ()
{
ifstream f ("sdo.in");
ofstream g ("sdo.out");
f>>n>>m;
for (i=1; i<=n; i++)
{
f>>crt;
a.push_back(crt);
}
sort(a.begin(),a.begin()+n);
g<<a[m-1];
return 0;
}