#include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <long long, long long> pll; int n, k; int a[2009]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); int x = k; while(x < n && a[x + 1] == a[k]) x++; cout << x << "\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 27 28 29 30 31 32 | #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair <int, int> pii; typedef pair <long long, long long> pll; int n, k; int a[2009]; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> n >> k; for(int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); reverse(a + 1, a + n + 1); int x = k; while(x < n && a[x + 1] == a[k]) x++; cout << x << "\n"; } |