Problem:
Score : 200 points

Problem Statement

Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?

Constraints

1 \leq a \leq 9

1 \leq b \leq 9

a and b are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)

Sample Input 1

4 3

Sample Output 1

3333

We have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.

Sample Input 2

7 7

Sample Output 2

7777777

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		Integer a = Integer.parseInt(sc.next());
		Integer b = Integer.parseInt(sc.next());

		List<String> list = new ArrayList<>();
		StringBuilder sb =  new StringBuilder();
		for(int i=0;i<b; i++) {
			sb.append(a.toString());
		}
		list.add(sb.toString());
		StringBuilder sb2 =  new StringBuilder();
		for(int i=0;i<a; i++) {
			sb2.append(b.toString());
		}
		list.add(sb2.toString());
		Collections.sort(list);
		System.out.println(list.get(0));

	}
}