I don't know how new you are to C++, so here is a possible solution with a few explanations. 
#include <map>
#include <vector>
#include <iostream>
//Avoid using namespace std as it can cause problems with conflicts of names
//and other sorts of nasty issues
using std::cout;
using std::cin;
using std::map;
using std::vector;
using std::endl;
//By using an ordered map you can more easily compare them
//The arguments are passed as const (you will never modify them)
//and also as reference (&) since you don't need to copy them.
bool CheckIfEqual (const vector<int> & V1, const vector<int> & V2) {
    //If the vectors don't have the same size you can just return false
    if (V1.size() != V2.size()) {
        return false;
    }
    map <int, size_t> M1;
    map <int, size_t> M2;
    //This type of loop goes through all elements of the vector and 
    //either creates a corrisponding value in the map or, if it is
    //already present, it increases it to accout for repetitions.
    //Map is automatically sorted.
    for (auto & Elem : V1) {
        M1[Elem]++;
    }
    for (auto & Elem : V2) {
        M2[Elem]++;
    }
    return M1 == M2;
}
//The main function is used to provide some examples
int main () {
    //Expected output: true
    vector<int> V1 {1, 2, 3, 4, 5};
    vector<int> V2 {1, 2, 3, 4 ,5};
    cout << CheckIfEqual(V1, V2) << endl;
    //Expected output: true
    V1 = {1, 2, 3, 4, 5};
    V2 = {5, 3, 2, 1 ,4};
    cout << CheckIfEqual(V1, V2) << endl;
    //Expected output: false
    V1 =  {1, 2, 3};
    V2 =  {5, 3};
    cout << CheckIfEqual(V1, V2) << endl;
    //Expected output: false
    V1 =  {1, 2, 3, 4, 5};
    V2 = {5, 3, 2, 1 ,1};
    cout << CheckIfEqual(V1, V2) << endl;
    //Expected output: true
    V1 = {1, 5, 5, 4, 5};
    V2 = {5, 5, 5, 1 ,4};
    cout << CheckIfEqual(V1, V2) << endl;
}
The output is
1
1
0
0
1
Also please be very very careful when using goto, it is deprecated and only useful when you need to jump out of many nested loops all at once. A simple break would have worked better.