#include <bits/stdc++.h>
typedef long long int lli;
using namespace std;
#define MAX4 10010
#define MAX5 100010
#define MAX6 1000010
template <typename T >
void dbg(T last)
{
cout << last << "\n";
}
template <typename T, typename ...args>
void dbg(T current, args ...next)
{
cout << current << ' ';
dbg(next...);
}
//-----------------------------------------------------------------------------------------------//
void solve()
{
int n, k;
cin >> n >> k;
int tab[n];
for (int i=0;i<n;i++)
{
cin >> tab[i];
}
sort(tab,tab+n);
int sum = 0;
int last = 0;
for (int i=n-1;i>=0;i--)
{
if (sum < k || last == tab[i])
{
sum++;
last = tab[i];
}
}
cout << sum;
}
int main()
{
std::ios::sync_with_stdio(false);
solve();
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 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 | #include <bits/stdc++.h> typedef long long int lli; using namespace std; #define MAX4 10010 #define MAX5 100010 #define MAX6 1000010 template <typename T > void dbg(T last) { cout << last << "\n"; } template <typename T, typename ...args> void dbg(T current, args ...next) { cout << current << ' '; dbg(next...); } //-----------------------------------------------------------------------------------------------// void solve() { int n, k; cin >> n >> k; int tab[n]; for (int i=0;i<n;i++) { cin >> tab[i]; } sort(tab,tab+n); int sum = 0; int last = 0; for (int i=n-1;i>=0;i--) { if (sum < k || last == tab[i]) { sum++; last = tab[i]; } } cout << sum; } int main() { std::ios::sync_with_stdio(false); solve(); return 0; } |
English