#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define mid (l+r)/2 #define PI acos((ld)-1) #define BOOST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<ii> vii; typedef vector<vi> vvi; const int N = 2e3+5; int main(){ BOOST; int n, k; cin >> n >> k; vi in(n); for(int i=0; i<n; i++) cin >> in[i]; sort(all(in), greater<int>()); while(k < n && in[k-1] == in[k]) k++; cout << k; }
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 | #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define mid (l+r)/2 #define PI acos((ld)-1) #define BOOST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<ii> vii; typedef vector<vi> vvi; const int N = 2e3+5; int main(){ BOOST; int n, k; cin >> n >> k; vi in(n); for(int i=0; i<n; i++) cin >> in[i]; sort(all(in), greater<int>()); while(k < n && in[k-1] == in[k]) k++; cout << k; } |