POJ 2159 Ancient Cipher

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<limits.h>
#include<time.h>
#include<stdlib.h>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#define LL long long

using namespace std;

int main()
{
    string s1, s2;
    while(cin >> s1 >> s2)
    {
        vector <int> v1, v2;
        for(int i = 0; i < 26; i++)
        {
            v1.push_back(0);
            v2.push_back(0);
        }
        for(int i = 0; i < s1.size(); i++)
        {
            v1[s1[i] - ‘A‘]++;
            v2[s2[i] - ‘A‘]++;
        }
        sort(v1.begin(), v1.end());
        sort(v2.begin(), v2.end());
        if(v1 == v2) puts("YES");
        else puts("NO");
    }
    return 0;
}