#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> points(n);
for(int i=0; i<n; i++)
cin >> points[i];
sort(points.begin(), points.end());
int howmany=1;
for(int i=n-2; i>=0; --i)
{
if(points[i]==points[i+1])
++howmany;
else if(howmany<k)
{
++howmany;
} else
break;
}
cout << howmany << "\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 | #include<bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vector<int> points(n); for(int i=0; i<n; i++) cin >> points[i]; sort(points.begin(), points.end()); int howmany=1; for(int i=n-2; i>=0; --i) { if(points[i]==points[i+1]) ++howmany; else if(howmany<k) { ++howmany; } else break; } cout << howmany << "\n"; return 0; } |
English