leetcode

0 class Solution {

1 public:

2 int matchPlayersAndTrainers(vector<int> &players, vector<int> &trainers) {

3 sort(begin(players), end(players));

4 sort(begin(trainers), end(trainers));

5

6 int res = 0;

7 for (int i = 0; res < players.size() && i < trainers.size(); i++)

8 res += trainers[i] >= players[res];

9 return res;

10 }

11 };