#include <bits/stdc++.h> using namespace std; const int N = 150; pair <int, int> ile[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; for(int i = 1; i <= n; i++){ int a; cin >> a; ile[a].first = -a; ile[a].second++; } sort(ile + 1, ile + 121); int i = 1; int kos = 0; while(ile[i].first != 0){ //cout << ile[i].first << " " << ile[i].second << "\n"; kos += ile[i].second; if(kos >= k) break; i++; } cout << kos << "\n"; }
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 | #include <bits/stdc++.h> using namespace std; const int N = 150; pair <int, int> ile[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; for(int i = 1; i <= n; i++){ int a; cin >> a; ile[a].first = -a; ile[a].second++; } sort(ile + 1, ile + 121); int i = 1; int kos = 0; while(ile[i].first != 0){ //cout << ile[i].first << " " << ile[i].second << "\n"; kos += ile[i].second; if(kos >= k) break; i++; } cout << kos << "\n"; } |