#include <bits/stdc++.h>
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define fi first
#define se second
#define ll long long
#define ld long double
#define pb push_back
#define vi vector<int>
#define MAXN 100001
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> V(n);
for (int i = 0; i < n; i++)
cin >> V[i];
sort(V.rbegin(), V.rend());
int r = k;
for (int i = k; i < n; i++) {
if (V[k - 1] == V[i])
r++;
else
break;
}
cout<<r<<endl;
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 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | #include <bits/stdc++.h> #define DEBUG(x) cout << '>' << #x << ':' << x << endl; #define fi first #define se second #define ll long long #define ld long double #define pb push_back #define vi vector<int> #define MAXN 100001 using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> V(n); for (int i = 0; i < n; i++) cin >> V[i]; sort(V.rbegin(), V.rend()); int r = k; for (int i = k; i < n; i++) { if (V[k - 1] == V[i]) r++; else break; } cout<<r<<endl; return 0; } |
English