vector "vector int " 判断重复问题

内部已经有一个vector<int>是 {1,2,3}，现在判断新的vector<int>是否已经包含在vector<vector<int>> 里：

内部有一个sort排序，是为了好判断；

#include <iostream>
#include <algorithm>
using namespace std;
bool is_element_in_vector(vector<vector<int>> vec, vector<int> element) {
    vector<vector<int>>::iterator it;
    it = find(vec.begin(), vec.end(), element);
    if (it != vec.end()) {
        return true;
    }
    else {
        return false;
    }
}
int main() {
    vector<vector<int>> vec;
    vector<int> a;
    a.push_back(1);
    a.push_back(2);
    a.push_back(3);
    sort(a.begin(), a.end());//为了好比较，排序
    vector<int> b;
    b.push_back(1);
    b.push_back(3);
    b.push_back(2);
    sort(b.begin(), b.end());
    vec.push_back(a);
    if (!is_element_in_vector(vec, b)) {
        vec.push_back(b);
        cout << "don't repeat" << endl;
    }
    cout << vec.size() << endl;
    return 0;
}