CF12B Correct Solution?

 

#include<iostream>
#include<cmath>
#include<iomanip>
#include<string>
#include<algorithm>
using namespace std;

int main()
{
    string s;
    getline(cin, s);
    int length = s.size();
    string in;
    getline(cin, in);
    int size = in.size();
    if (length != size) {
        cout << "WRONG_ANSWER";
        return 0;
    }
    else if (s[0] == '0' && in[0] == '0') 
    {
        printf("OK");
        return 0;
    }
    int* num = new int[length];
    for (int i = 0; i < length; i++)
    {
        num[i] = int(s[i]) - int('0');
    }
    //cout << length << endl;
    for (int i = 0; i < length - 1; i++)
    {
        for (int j = 0; j < length - i - 1; j++)
        {
            if (num[j] > num[j + 1])
            {
                char temp = num[j];
                num[j] = num[j + 1];
                num[j + 1] = temp;
            }
        }
    }
    int a = -1;
    for (int i = 0; i < length; i++)
    {
        if (num[i] == 0)
        {
            a = i;
        }
        else
        {
            break;
        }
    }//找到排序后最后一个0的位置
    if (a != -1) {
        char temp = num[0];
        num[0] = num[a + 1];
        num[a + 1] = temp;
    }

    for (int i = 0; i < size; i++)
    {
        //比较
        int judge = in[i] - '0';
        if (judge != num[i]) 
        {
            cout << "WRONG_ANSWER";
            return 0;
        }
    }
    cout << "OK";

}

给这题折磨烂了