import
java.io.*;
import
java.util.Comparator;
import
java.util.TreeSet;
class
MySort
implements
Comparator<Element> {
@Override
public
int
compare(Element e1, Element e2)
{
if
(e1.getvalue() > e2.getvalue()) {
return
1
;
}
else
{
return
-
1
;
}
}
}
class
Element {
private
String name;
private
int
value;
public
Element(String n,
int
s)
{
this
.name = n;
this
.value = s;
}
public
String getname() {
return
name; }
public
int
getvalue() {
return
value; }
public
String toString()
{
return
"element: "
+
this
.name
+
", value: "
+
this
.value;
}
}
class
GFG {
public
static
void
main(String[] args)
{
TreeSet<Element> Tree
=
new
TreeSet<Element>(
new
MySort());
Tree.add(
new
Element(
"A"
,
36778
));
Tree.add(
new
Element(
"B"
,
456456
));
Tree.add(
new
Element(
"C"
,
76433
));
Tree.add(
new
Element(
"D"
,
4564
));
System.out.println(
"Least value =>"
+ Tree.first());
}
}