#include <iostream> #include <algorithm> using namespace std; short int n, k, i; short int tab[2002]; int main() { cin >> n >> k; for(i=1;i<=n;i++) { cin >> tab[i]; } i=k; sort(tab+1, tab+n+1, greater <int> ()); while(tab[i]==tab[i+1]) { i++; k++; } cout << k; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | #include <iostream> #include <algorithm> using namespace std; short int n, k, i; short int tab[2002]; int main() { cin >> n >> k; for(i=1;i<=n;i++) { cin >> tab[i]; } i=k; sort(tab+1, tab+n+1, greater <int> ()); while(tab[i]==tab[i+1]) { i++; k++; } cout << k; return 0; } |