#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int n, k; cin >> n >> k; vector <int> v(n); for (auto& x : v) cin >> x; sort(v.rbegin(), v.rend()); int temp = 0; for (int i = k; i < n; i++) { if (v[i] == v[i - 1]) temp++; else break; } cout << k+ temp << "\n"; }
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 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { cin.tie(0); ios_base::sync_with_stdio(0); int n, k; cin >> n >> k; vector <int> v(n); for (auto& x : v) cin >> x; sort(v.rbegin(), v.rend()); int temp = 0; for (int i = k; i < n; i++) { if (v[i] == v[i - 1]) temp++; else break; } cout << k+ temp << "\n"; } |