hdu 2648 shopping java版

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2648

Shopping
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2118    Accepted Submission(s): 706

Problem Description：
Every girl likes shopping,so does dandelion.Now she finds the shop is increasing the price every day because the Spring Festival is coming .She is fond of a shop which is called "memory". Now she wants to know the rank of this shop's price after the change of everyday.

Input：
One line contians a number n ( n<=10000),stands for the number of shops.
Then n lines ,each line contains a string (the length is short than 31 and only contains lowercase letters and capital letters.)stands for the name of the shop.
Then a line contians a number m (1<=m<=50),stands for the days .
Then m parts , every parts contians n lines , each line contians a number s and a string p ,stands for this day ,the shop p 's price has increased s.

Output：
Contains m lines ,In the ith line print a number of the shop "memory" 's rank after the ith day. We define the rank as :If there are t shops' price is higher than the "memory" , than its rank is t+1.

Sample Input：
3
memory
kfc
wind
2
49 memory
49 kfc
48 wind
80 kfc
85 wind
83 memory

Sample Output
1
2

简单的运用java的HashMap，不想排序比较的话，可以使用TreeMap。 

import java.util.Map.Entry;
import java.util.*;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n,m;
        HashMap<String,Integer> map = new HashMap<>();
            n=sc.nextInt();
            String s;
            for(int i=1;i<=n;i++){
                s=sc.next();
                map.put(s,0);
            }
            m=sc.nextInt();
            while(m-->0){
                for(int i=1;i<=n;i++){
                    int p=sc.nextInt();
                    String ss=sc.next();
                    map.compute(ss,(a,b)->b+p);
                }
                int rank=1;
                Iterator<Integer> it = map.values().iterator();//这里使用的是迭代器
                while(it.hasNext()){
                    if(it.next()>map.get("memory"))rank++;
                }
                System.out.println(rank);
            }
            map.clear();
        }
    }

import java.util.*;
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n,m;
        HashMap<String,Integer> map = new HashMap<>();
            n=sc.nextInt();
            String s;
            for(int i=1;i<=n;i++){
                s=sc.next();
                map.put(s,0);
            }
            m=sc.nextInt();
            while(m-->0){
                for(int i=1;i<=n;i++){
                    int p=sc.nextInt();
                    String ss=sc.next();
                    map.compute(ss,(a,b)->b+p);
                }
                int rank=1;
                for(Integer sss:map.values()){//foreach非常好用
                    if(sss>map.get("memory"))rank++;
                }
                System.out.println(rank);
            }
            map.clear();
        }
    }