#include <iostream>

#include <queue>

#include<algorithm>

using namespace std;

int n, k;

bool visited[100001];

void bfs() {

priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;

visited[n] = true;

q.push({ 0,n });

while (!q.empty()) {

int cur = q.top().second;

int time = q.top().first;

if (cur == k) {

cout << time<<"\n";

return;

}

q.pop();

if (cur != 0 && cur * 2 <=100000 && !visited[cur * 2]) {

q.push({ time,cur * 2 });

visited[cur * 2] = true;

}

if (cur + 1 <=100000 && !visited[cur + 1]) {

q.push({(time+1), cur + 1 });

visited[cur + 1] = true;

}

if (cur - 1 >= 0 && !visited[cur - 1]) {

q.push({(time+1), cur - 1});

visited[cur - 1] = true;

}

}

}

int main() {

ios_base::sync_with_stdio(0);

cin.tie(0); cout.tie(0);

cin >> n >> k;

bfs();

return 0;

}

이건 성공하는데 time에 -를 붙혀서 푼건 틀리다고 나오네요