fork download
copy 
  1. /* وَقُلْ رَبِّ زِدْنِي عِلْمًاً */
  2. #include <iostream>
  3. #include <algorithm>
  4. #include <cmath>
  5. #include <string>
  6. #include <iomanip>
  7. #include <stack>
  8. #include <set>
  9. #include <queue>
  10. #include <deque>
  11. #include <vector>
  12. #include <fstream>
  13. #include <cctype>
  14. #include <utility>
  15.  
  16. #define ll long long
  17. #define ld long double
  18. #define sz(v)   ((int)(v).size())
  19. #define all(v)    ((v).begin()),((v).end())
  20. #define setp(n) cout << fixed << setprecision(n)
  21. #define O_o ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  22. #define yes cout << "YES\n"
  23. #define no cout << "NO\n"
  24. #define fi(nn) for(ll i = 0; i < (nn); i++)
  25. #define fj(nn) for(ll j = 0; j < (nn); j++)
  26. #define fl(nn) for (ll i = nn - 1; i >= 0; i--)
  27. #define ffij(nn,mm) for(ll i = 0; i < (nn); i++)for(ll j = 0; j < (mm); j++)
  28. #define null NULL
  29. using namespace std;
  30.  
  31. int main()
  32. {
  33.     O_o
  34.         ll n, k;
  35.     cin >> n >> k;
  36.     vector<ll>v(n);
  37.     fi(n)cin >> v[i];
  38.     sort(v.begin(), v.end());
  39.     ll co = 0, nums = 0;
  40.     for (ll i = 0;i < n;i++) {
  41.         if (i != n - 1 && v[i] == v[i + 1]) {
  42.             co++;
  43.         }
  44.         else {
  45.             nums++;
  46.             nums += co;
  47.             co = 0;
  48.             if (nums == k) {
  49.                 cout << v[i];
  50.                 return 0;
  51.             }
  52.         }
  53.     }
  54.     cout << -1;
  55.     return 0;
  56. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin
copy 
7 2
3 7 5 1 10 3 20
stdout
copy 
-1
https://ideone.com/mBdih8
language:
C++ (gcc 8.3)
created:
12 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!