You are on page 1of 2

import java.util.

TreeSet;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Scanner;
import javax.swing.text.html.HTMLDocument.Iterator;
public class abc {
public static void main(String args[])
{
TreeSet<Integer> ob=new TreeSet<Integer>();
Scanner sc =new Scanner(System.in);
for(int i=0;i<4;i++)
{
ob.add(sc.nextInt());
}
java.util.Iterator<Integer> it=ob.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}

import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeSet;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Scanner;
import javax.swing.text.html.HTMLDocument.Iterator;
public class abc {
public static void main(String args[])
{
HashMap<Integer,String> ob=new HashMap<Integer,String >();
Scanner sc =new Scanner(System.in);
for(int i=0;i<4;i++)
{
ob.put(sc.nextInt(),sc.next());
System.out.println(ob);
}
Set<Map.Entry<Integer,String>> st=ob.entrySet();
java.util.Iterator<Entry<Integer,String>> i=st.iterator();
while(i.hashNext())
System.out.println(i.Next());

}
}

You might also like