数位排序-蓝桥杯

public class Main {
	static int[] arr = new int[1000010];
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int n = scan.nextInt();
        int m = scan.nextInt();
        ArrayList<Node>list = new ArrayList<>();
        for (int i = 1; i <=n; i++) {
			list.add(new Node(i));
		}
        Collections.sort(list);
        System.out.println(list.get(m-1).num);
    }
}

class Node implements Comparable<Node>{
	int num;
	int sum;
	public Node(int num) {
		this.num = num;
		this.sum = calc(num);
	}
	
	public int calc(int num) {
    	int sum1 = 0;
    	while (num>0) {
			sum1+=num%10;
			num/=10;
		}
    	return sum1;
	}
	@Override
	public int compareTo(Node o) {
		// TODO Auto-generated method stub
		if (o.sum>this.sum) {
			return -1;
		}else if (o.sum==this.sum) {
			if (o.num>this.num) {
				return -1;
			}else {
				return 1;
			}
		}
		return 1;
	}
	
}