CF 12B Correct Solution?

题意 给两个数 问第一个数重新排列后最小的非前导零的数是否是第二个

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
    char a[15],b[15];
    while(cin>>a>>b)
    {
        int len_a = strlen(a);
        sort(a,a+len_a);
        int k = 0;
        for(int i = 0;i < len_a;i ++)
        {
            if(a[i] != '0')
            {
                k = i;
                break;
            }
        }
        char tmp;
        tmp = a[0];
        a[0] = a[k];
        a[k] = tmp;
        if(strcmp(a,b) == 0)
            cout<<"OK"<<endl;
        else
            cout<<"WRONG_ANSWER"<<endl;
    }
    return 0;
}