java 水果店_[算法练习题]水果店-JAVA问题

import java.util.Map.Entry;

import java.util.Scanner;

import java.util.TreeMap;

public class Main {

public static void main(String[] args) {

Scanner sc=new Scanner(System.in);

int n;

String s1,s2;int s3;

int j=0;

n=sc.nextInt();

TreeMap mp=new TreeMap();

for(int i=0;i

s1=sc.next();s2=sc.next();s3=sc.nextInt();

if(mp.containsKey(s2+" “+s1)){

s3+=mp.get(s2+” “+s1);

mp.put(s2+” “+s1, s3); //因为是按产地排序

}else{ //经过多次失误

mp.put(s2+” “+s1, s3); //最后成功取对形式

}

}

int m=mp.size();

String ss[]=new String[m];

for(Entry entry:mp.entrySet()){

ss[j++]=entry.getKey()+” “+entry.getValue();

}

String s4=”";