#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; int cnt,o; cnt=o=0; cin >> n >> k; int arr[2005]={}; vector < int > vec; for(int i=1;i<=n;i++) { cin >> a; vec.push_back(a); arr[a]++; } //sort(vec.begin(),vec.end()); for(int i=121;i>=0;i--) { //cout << vec[i] << endl; if(arr[i]>0) { cnt+=arr[i]; } if(cnt>=k) break; } cout << cnt; 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 | #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; int cnt,o; cnt=o=0; cin >> n >> k; int arr[2005]={}; vector < int > vec; for(int i=1;i<=n;i++) { cin >> a; vec.push_back(a); arr[a]++; } //sort(vec.begin(),vec.end()); for(int i=121;i>=0;i--) { //cout << vec[i] << endl; if(arr[i]>0) { cnt+=arr[i]; } if(cnt>=k) break; } cout << cnt; return 0; } |