#include<bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> v; for(int i = 0; i < n; i++) { int a; cin >> a; v.push_back(-a); } if(n == k) { cout << n; } else { sort(v.begin(), v.end()); int x = 0; x = v[k-1]; if(v[k] > x) cout << k; else { vector<int>::iterator up; up = upper_bound (v.begin(), v.end(), x); cout << up - v.begin(); } } }
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 | #include<bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> v; for(int i = 0; i < n; i++) { int a; cin >> a; v.push_back(-a); } if(n == k) { cout << n; } else { sort(v.begin(), v.end()); int x = 0; x = v[k-1]; if(v[k] > x) cout << k; else { vector<int>::iterator up; up = upper_bound (v.begin(), v.end(), x); cout << up - v.begin(); } } } |