#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int numContestants, numTshirts, pos; ios::sync_with_stdio(false); cin >> numContestants >> numTshirts; vector<int> contestants(numContestants); --numTshirts; for(int i=0; i<numContestants; ++i) cin >> contestants[i]; sort(contestants.begin(), contestants.end(), greater<int>()); pos = numTshirts; for(; pos<numContestants && contestants[pos]==contestants[numTshirts]; ++pos); cout << pos << endl; 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 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int numContestants, numTshirts, pos; ios::sync_with_stdio(false); cin >> numContestants >> numTshirts; vector<int> contestants(numContestants); --numTshirts; for(int i=0; i<numContestants; ++i) cin >> contestants[i]; sort(contestants.begin(), contestants.end(), greater<int>()); pos = numTshirts; for(; pos<numContestants && contestants[pos]==contestants[numTshirts]; ++pos); cout << pos << endl; return 0; } |