#include <bits/stdc++.h> #define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define debug(x) cerr << #x << " " << x << endl #define int long long #define st first #define nd second using namespace std; const int N(2e3 + 13); const int MAX(LLONG_MAX); int n, k, res; bool flag; string s; int arr[N]; int32_t main() { boost; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> arr[i]; } res = k; sort(arr + 1, arr + 1 + n, greater<int>()); for (int i = k + 1; i <= n; i++) { if (arr[i] == arr[i - 1]) { res++; } else { break; } } cout << res << endl; }
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 | #include <bits/stdc++.h> #define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define debug(x) cerr << #x << " " << x << endl #define int long long #define st first #define nd second using namespace std; const int N(2e3 + 13); const int MAX(LLONG_MAX); int n, k, res; bool flag; string s; int arr[N]; int32_t main() { boost; cin >> n >> k; for (int i = 1; i <= n; i++) { cin >> arr[i]; } res = k; sort(arr + 1, arr + 1 + n, greater<int>()); for (int i = k + 1; i <= n; i++) { if (arr[i] == arr[i - 1]) { res++; } else { break; } } cout << res << endl; } |