#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,k,a,ans=0; vector <int> t; set <int> q; set <int>::iterator it; cin>>n>>k; for(int i=0;i<n;i++) { cin>>a; t.push_back(a); q.insert(a); } sort(t.begin(),t.end()); it=q.end(); it--; for(int i=t.size()-1;i>=0;i--) { //cout<<t[i]<<" "<<*it<<"\n"; if(t[i]==*it) ans++; else { if(ans>=k) break; it--; ans++; //cout<<*it<<" "<<t[i]<<"!!\n"; } } cout<<ans; 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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,k,a,ans=0; vector <int> t; set <int> q; set <int>::iterator it; cin>>n>>k; for(int i=0;i<n;i++) { cin>>a; t.push_back(a); q.insert(a); } sort(t.begin(),t.end()); it=q.end(); it--; for(int i=t.size()-1;i>=0;i--) { //cout<<t[i]<<" "<<*it<<"\n"; if(t[i]==*it) ans++; else { if(ans>=k) break; it--; ans++; //cout<<*it<<" "<<t[i]<<"!!\n"; } } cout<<ans; return 0; } |