class Solution {
public:
bool canConstruct(string a, string b) {
int i = 0, j = 0;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int n = a.size(), m = b.size();
while (i < n && j < m) {
if (a[i] == b[j]) i ++ ;
j ++ ;
}
return i == n;
}
};