/* Zadanie: Koszulki Autor: Tomasz Kwiatkowski */ #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; const int MAXN = 1000*1000 + 7; const int INF = 1000*1000*1000 + 7; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n, k; cin >> n >> k; vector<int> sizes(n); for (auto& s : sizes) cin >> s; sort(sizes.rbegin(), sizes.rend()); int i = 0; while (i < k || (sizes[i] == sizes[i - 1])) { ++i; } cout << i << '\n'; 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 | /* Zadanie: Koszulki Autor: Tomasz Kwiatkowski */ #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; const int MAXN = 1000*1000 + 7; const int INF = 1000*1000*1000 + 7; int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n, k; cin >> n >> k; vector<int> sizes(n); for (auto& s : sizes) cin >> s; sort(sizes.rbegin(), sizes.rend()); int i = 0; while (i < k || (sizes[i] == sizes[i - 1])) { ++i; } cout << i << '\n'; return 0; } |