#include <bits/stdc++.h>
#define append push_back
#define s second
#define f first
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
if(n==m){
cout<<m; return 0;
}
int L[n], h;
for(int i=0; i<n; i++){
cin>>h;
L[i]=-h;
}
sort(L,L+n);
h=L[m-1];
int wyn=m;
for(int i=m; i<n && L[i]==h; i++){
if(L[i]==h) wyn++;
}
cout<<wyn;
return 0;
}
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 | #include <bits/stdc++.h> #define append push_back #define s second #define f first #define ll long long using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m; cin>>n>>m; if(n==m){ cout<<m; return 0; } int L[n], h; for(int i=0; i<n; i++){ cin>>h; L[i]=-h; } sort(L,L+n); h=L[m-1]; int wyn=m; for(int i=m; i<n && L[i]==h; i++){ if(L[i]==h) wyn++; } cout<<wyn; return 0; } |
English