#include <iostream> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; int shirts = k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, &a[n], greater<int>()); for (int i = k; i < n; i++) { if (a[i] == a[i - 1]) shirts++; } cout << shirts; 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 | #include <iostream> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; int shirts = k; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, &a[n], greater<int>()); for (int i = k; i < n; i++) { if (a[i] == a[i - 1]) shirts++; } cout << shirts; return 0; } |