Cod sursa(job #2273025)
Utilizator | Data | 30 octombrie 2018 21:29:48 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("sdo.in") ;
ofstream g("sdo.out") ;
long long n , i , nr , x , a[90000];
int main()
{
f >> n >> nr ;
for( i = 1 ; i <= n ; i ++ ){
f >> x ;
if( x < 90000 )
a[x] ++ ;
}
i = 1 ;
while( nr >= 1 )
{
nr = nr - a[i] ;
i ++ ;
}
g << i - 1 ;
}