#include <bits/stdc++.h> #define PB push_back #define ST first #define ND second #define _ ios_base::sync_with_stdio(0); cin.tie(0); //mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); using namespace std; using ll = long long; using pi = pair<int,int>; using vi = vector<int>; int n, k; vi v; int main() {_ cin >> n >> k; v.resize(n); for(int i = 0; i < n; ++i) cin >> v[i]; sort(v.rbegin(), v.rend()); int val = v[k - 1]; int ans = 0; for(int i = 0; i < n; ++i) { if(v[i] >= val) { ans++; } } cout << ans; }
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 | #include <bits/stdc++.h> #define PB push_back #define ST first #define ND second #define _ ios_base::sync_with_stdio(0); cin.tie(0); //mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); using namespace std; using ll = long long; using pi = pair<int,int>; using vi = vector<int>; int n, k; vi v; int main() {_ cin >> n >> k; v.resize(n); for(int i = 0; i < n; ++i) cin >> v[i]; sort(v.rbegin(), v.rend()); int val = v[k - 1]; int ans = 0; for(int i = 0; i < n; ++i) { if(v[i] >= val) { ans++; } } cout << ans; } |