#include <bits/stdc++.h> #define vt vector #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define F first #define S second #define pb emplace_back #define pii pair <int, int> typedef long long ll; using namespace std; int main() { ios_base::sync_with_stdio(0); int n, k; cin >> n >> k; vt <int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(all(v), greater <int>()); int ans = k; while(ans < n && v[ans] == v[k - 1]) ans++; cout << ans << " \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 | #include <bits/stdc++.h> #define vt vector #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define F first #define S second #define pb emplace_back #define pii pair <int, int> typedef long long ll; using namespace std; int main() { ios_base::sync_with_stdio(0); int n, k; cin >> n >> k; vt <int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; sort(all(v), greater <int>()); int ans = k; while(ans < n && v[ans] == v[k - 1]) ans++; cout << ans << " \n"; } |