import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main
{
void solve()
{
HashSet<Integer> s = new HashSet<Integer>();
s.add(2);
s.add(3);
s.add(2);
s.add(4);
s.remove(3);
for(int i : s) System.out.print(i+" ");
System.out.println();System.out.println();
HashMap<Integer,Integer> mp = new HashMap<Integer,Integer>();
mp.put(1,2);
mp.put(2,3);
mp.put(3, 4);
mp.remove(3);
for(HashMap.Entry<Integer,Integer> entry : mp.entrySet())
{
System.out.println(entry.getKey()+" "+entry.getValue());
}
System.out.println();
Comparator<Integer> cmp;
cmp = new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2-o1;
}
};
TreeSet<Integer> treeset = new TreeSet<Integer>(cmp);
treeset.add(1);
treeset.add(2);
treeset.add(3);
treeset.add(4);
for(int i :treeset)System.out.print(i+" ");System.out.println();
TreeMap<Integer,Integer> treemap = new TreeMap<Integer,Integer>(cmp);
treemap.put(1,3);
treemap.put(2,2);
treemap.put(3,4);
treemap.remove(3);
System.out.println();
for(HashMap.Entry<Integer,Integer> entry : treemap.entrySet())
{
System.out.println(entry.getKey()+" "+entry.getValue());
}
System.out.println();
Integer [] a = {1,2,3,4,5,6};
Arrays.sort(a,0,a.length);
for(int i = 0;i<a.length;i++)System.out.print(a[i]+" ");System.out.println();
Arrays.sort(a,0,a.length,cmp);
for(int i = 0;i<a.length;i++)System.out.print(a[i]+" ");System.out.println();
ArrayList<Integer> list = new ArrayList<Integer>();
for(int i = 0;i<5;i++)
{
list.add(i);
}
System.out.println();
Collections.sort(list);
for(int i = 0;i<list.size();i++)
{
System.out.print(list.get(i)+" ");
}
System.out.println();
Collections.sort(list, cmp);
for(int i = 0;i<list.size();i++)
{
System.out.print(list.get(i)+" ");
}
System.out.println();
}
public static void main(String[] args)
{
new Main().solve();
}
}