模拟-贪婪的送礼者Greedy Gift Givers

深碍√TFBOYSˉ_ 2023-07-15 09:03 22阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70 1]  
**输入 \#1**

5
    dave
    laura
    owen
    vick
    amr
    dave
    200 3
    laura
    owen
    vick
    owen
    500 1
    dave
    amr
    150 2
    vick
    owen
    laura
    0 2
    amr
    vick
    vick
    0 0

**输出 \#1**

dave 302
    laura 66
    owen -359
    vick 141
    amr -150

import java.util.Arrays;
    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.LinkedHashMap;
    import java.util.LinkedList;
    import java.util.Map;
    import java.util.Scanner;
    
    
    public class Main {
        
        public static void main(String[] args) {
        
            Scanner scanner=new Scanner(System.in);
            int n=scanner.nextInt();
            Map<String, Integer> map=new LinkedHashMap<String, Integer>();
            for(int i=0;i<n;i++) {
        
                String s=scanner.next();
                map.put(s, 0);
            }
            while(n>0) {
        
                n--;
                String s1=scanner.next();
    
                int a=scanner.nextInt();
                int b=scanner.nextInt();
    
                int num=0;
                if (b!=0) {
        
                    num=a/b;
                    int jian=map.get(s1)-num*b;
                    map.put(s1, jian);
                    for(int i=0;i<b;i++) {
        
                        String s2=scanner.next();
                        if (map.containsKey(s2)) {
        
                            int s2_num=map.get(s2)+a/b;
                            map.put(s2, s2_num);
                        }
                    }
                }
            }
    
            for(String key:map.keySet()) {
        
                System.out.println(key+" "+map.get(key));
            }
        }
    
    }

## map的输出，对于LinkedHashMap对键是不排序的，HashMap就默认排序，有点难搞的 ##

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70]: /images/20230528/c52c6b120d4941dda2382e83d7c38419.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70 1]: /images/20230528/f266c3a7d6fa4b18b8924caa9bb63fdf.png