Cod sursa(job #1473229)
Utilizator | Data | 18 august 2015 20:49:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
#define MA 3000050
ifstream in ("sdo.in");
ofstream out("sdo.out");
int v[MA];
int main()
{
int n,k,i;
in>>n;
in>>k;
for(i=1; i<=n; i++)
in>>v[i];
nth_element(v+1,v+k,v+n+1);
out<<v[k]<<'\n';
return 0;
}