Cod sursa(job #2273198)
Utilizator | Data | 31 octombrie 2018 10:20:36 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
map <long long, int> m;
int n, k, a;
int main() {
fin >> n >> k;
for (int i = 1; i <= n; ++i) {
fin >> a;
++m[a];
}
for (auto i = m.begin(); i != m.end(); ++i) {
k -= i -> second;
if (k <= 0) {
fout << i -> first << '\n';
return 0;
}
}
}