仓库新进了几批物资,只知道每批物资的数量和单价,编写程序,按照每种物资的总价值,从高到低次序输出。
输入说明:第一行一个整数N 表明物资的批次数量
第2-N+1行,每批物资的数量和单价,类别用A-Z区分。
输入样例:5
A 5 10
B 3 2
A 5 8
B 3 3
C 10 3
输出样例:
A 90
C 30
B 15
package zzhaosheng;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
public class cangku {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
HashMap<String,Integer> cangku = new HashMap<>();
{
cangku.put("A", 0);
cangku.put("B", 0);
cangku.put("C", 0);
cangku.put("D", 0);
cangku.put("E", 0);
cangku.put("F", 0);
cangku.put("G", 0);
cangku.put("H", 0);
cangku.put("I", 0);
cangku.put("J", 0);
cangku.put("K", 0);
cangku.put("L", 0);
cangku.put("M", 0);
cangku.put("N", 0);
cangku.put("O", 0);
cangku.put("P", 0);
cangku.put("Q", 0);
cangku.put("R", 0);
cangku.put("S", 0);
cangku.put("T", 0);
cangku.put("U", 0);
cangku.put("V", 0);
cangku.put("W", 0);
cangku.put("X", 0);
cangku.put("Y", 0);
cangku.put("Z", 0);
}
System.out.println("输入要输入几次N");
int N = sc.nextInt();
for(int i=0;i<N;i++) {
System.out.println("输入代号 数量 单价");
String cname = sc.next();
int shuliang = sc.nextInt();
int danjia = sc.nextInt();
addcangku(cangku,cname,shuliang,danjia);
}
System.out.println(cangku);
/*
* 对HashMap按值排序
*/
List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>(cangku.entrySet());
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
//降序排序
@Override
public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
return o2.getValue().compareTo(o1.getValue());
}
});
for (Map.Entry<String, Integer> cangku1 : list) {
if(cangku1.getValue()!=0) {
System.out.println(cangku1.getKey() + ":" + cangku1.getValue());
}
}
//================================================================
}
private static HashMap<String,Integer> addcangku(Map<String, Integer> cangku,String cname,int shuliang,int danjia){
Integer count = cangku.get(cname);
cangku.put(cname, (shuliang*danjia)+count);
return (HashMap<String, Integer>) cangku;
}
}