#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> /* #pragma GCC target("avx2") #pragma GCC optimization("Ofast") #pragma GCC optimization("unroll-loops") */ using namespace __gnu_pbds; using namespace std; #define mp make_pair #define eb emplace_back #define pb push_back #define e1 first #define e2 second #define vt vector #define maxi(x,y) x=max(x,y) #define mini(x,y) x=min(x,y) #define size(x) (int)x.size() #define all(r) begin(r),end(r) #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define cx real() #define cy imag() #define precision(x) setprecision(x)<<fixed #define time chrono::high_resolution_clock().now().time_since_epoch().count() #ifndef DEBUG #define DEBUG false #endif #define dbg if(DEBUG) typedef long long ll; typedef long double ld; typedef complex<long double> cplx; typedef unsigned int uint; typedef unsigned long long ull; typedef vt<int> vi; typedef vt<vi> vvi; typedef vt<bool> vb; typedef vt<vb> vvb; typedef vt<char> vc; typedef vt<vc> vvc; typedef vt<string> vs; typedef vt<vs> vvs; typedef vt<ll> vll; typedef vt<vll> vvll; typedef vt<ld> vld; typedef vt<vld> vvld; typedef vt<cplx> vcplx; typedef vt<vcplx> vvcplx; template<typename T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; template<typename T1,typename T2> ostream& operator<<(ostream &os,pair<T1,T2>& VAR){ os<<"("<<VAR.e1<<","<<VAR.e2<<")"; return os; } template<typename T> ostream& operator<<(ostream& os,vt<T>& VAR){ os<<"["; for(int i=0;i<size(VAR)-1;i++) os<<VAR[i]<<","; if(size(VAR)) os<<VAR.back(); os<<"]"; return os; } template<typename T> istream& operator>>(istream& is,complex<T>& VAR){ T value; is>>value; VAR.real(value); is>>value; VAR.imag(value); return is; } const bool TESTS=false; void solve(){ int n,k; cin>>n>>k; vi a(n); for(auto& x:a) cin>>x; sort(all(a),greater<int>()); int val=a[k-1]; while(k<n&&a[k]==val) k++; cout<<k<<'\n'; } int32_t main(){ fastio; if(TESTS){ int TEST_COUNT; cin>>TEST_COUNT; for(int i=0;i<TEST_COUNT;i++) solve(); } else solve(); 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 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 | #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> /* #pragma GCC target("avx2") #pragma GCC optimization("Ofast") #pragma GCC optimization("unroll-loops") */ using namespace __gnu_pbds; using namespace std; #define mp make_pair #define eb emplace_back #define pb push_back #define e1 first #define e2 second #define vt vector #define maxi(x,y) x=max(x,y) #define mini(x,y) x=min(x,y) #define size(x) (int)x.size() #define all(r) begin(r),end(r) #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define cx real() #define cy imag() #define precision(x) setprecision(x)<<fixed #define time chrono::high_resolution_clock().now().time_since_epoch().count() #ifndef DEBUG #define DEBUG false #endif #define dbg if(DEBUG) typedef long long ll; typedef long double ld; typedef complex<long double> cplx; typedef unsigned int uint; typedef unsigned long long ull; typedef vt<int> vi; typedef vt<vi> vvi; typedef vt<bool> vb; typedef vt<vb> vvb; typedef vt<char> vc; typedef vt<vc> vvc; typedef vt<string> vs; typedef vt<vs> vvs; typedef vt<ll> vll; typedef vt<vll> vvll; typedef vt<ld> vld; typedef vt<vld> vvld; typedef vt<cplx> vcplx; typedef vt<vcplx> vvcplx; template<typename T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; template<typename T1,typename T2> ostream& operator<<(ostream &os,pair<T1,T2>& VAR){ os<<"("<<VAR.e1<<","<<VAR.e2<<")"; return os; } template<typename T> ostream& operator<<(ostream& os,vt<T>& VAR){ os<<"["; for(int i=0;i<size(VAR)-1;i++) os<<VAR[i]<<","; if(size(VAR)) os<<VAR.back(); os<<"]"; return os; } template<typename T> istream& operator>>(istream& is,complex<T>& VAR){ T value; is>>value; VAR.real(value); is>>value; VAR.imag(value); return is; } const bool TESTS=false; void solve(){ int n,k; cin>>n>>k; vi a(n); for(auto& x:a) cin>>x; sort(all(a),greater<int>()); int val=a[k-1]; while(k<n&&a[k]==val) k++; cout<<k<<'\n'; } int32_t main(){ fastio; if(TESTS){ int TEST_COUNT; cin>>TEST_COUNT; for(int i=0;i<TEST_COUNT;i++) solve(); } else solve(); return 0; } |