#include <bits/stdc++.h> #define gc getchar #define gcu getchar_unlocked #define fi first #define se second #define pb push_back #define mod ((ll)1e9 + 7) typedef long long ll; using namespace std; //============================================= int n, m; int a[100000]; //============================================= int main() { scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); a[i] *= -1; } sort(a, a + n); for (int i = m; i < n; i++) if (a[m - 1] == a[i]) m++; printf("%d\n", m); } //=============================================
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 gc getchar #define gcu getchar_unlocked #define fi first #define se second #define pb push_back #define mod ((ll)1e9 + 7) typedef long long ll; using namespace std; //============================================= int n, m; int a[100000]; //============================================= int main() { scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); a[i] *= -1; } sort(a, a + n); for (int i = m; i < n; i++) if (a[m - 1] == a[i]) m++; printf("%d\n", m); } //============================================= |