Cod sursa(job #1795168)
Utilizator | Data | 2 noiembrie 2016 02:11:00 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <iterator>
#include <map>
using namespace std;
main()
{
ifstream cin("sdo.in");
ofstream cout("sdo.out");
int n, k, y;
map<int, int> h;
cin>>n>>k;
for(int i = 0; i < n; i++) {
cin>>y;
h[y] = h.count(y) + 1;
}
for (int i = 0; i < k; i++) {
if (k > h[i]) {
k-=h[i];
} else {
cout<<i;
break;
}
}
}