【Codeforces 522B】Photo to Remember

【链接】 我是链接,点我呀:)
【题意】


题意

【题解】


模拟题、用set模拟下就好

【代码】

import java.io.*;
import java.util.*;

public class Main {
    
    
    static InputReader in;
    static PrintWriter out;
        
    public static void main(String[] args) throws IOException{
        //InputStream ins = new FileInputStream("E:\\rush.txt");
        InputStream ins = System.in;
        in = new InputReader(ins);
        out = new PrintWriter(System.out);
        //code start from here
        new Task().solve(in, out);
        out.close();
    }
    
    static int N = 200000;
    static class Task{

        static class cmp implements Comparator<Integer>{

            @Override
            public int compare(Integer o1, Integer o2) {
                return o2-o1;
            }
            
        }
        
        int n;
        int w[] = new int[N+10],h[] = new int[N+10];
        int cnt[] = new int[N+10];
        long sum = 0;
        TreeSet myset = new TreeSet(new cmp());
        
        public void solve(InputReader in,PrintWriter out) {
            n = in.nextInt();
            for (int i = 1;i <= n;i++) { 
                w[i] = in.nextInt();h[i] = in.nextInt();
                if (myset.contains(h[i])) {
                    cnt[h[i]]++;
                }else {
                    myset.add(h[i]);
                    cnt[h[i]] = 1;
                }
                sum = sum + w[i];
            }
            
            for (int i = 1;i <= n;i++) {
                long tempsum = sum - w[i];
                if (cnt[h[i]]==1) {
                    myset.remove(h[i]);
                }
                int high = (int)myset.first();
                out.print(1l*high*tempsum+" ");
                if (cnt[h[i]]==1) {
                    myset.add(h[i]);
                }
            }
            
        }
    }

    

    static class InputReader{
        public BufferedReader br;
        public StringTokenizer tokenizer;
        
        public InputReader(InputStream ins) {
            br = new BufferedReader(new InputStreamReader(ins));
            tokenizer = null;
        }
        
        public String next(){
            while (tokenizer==null || !tokenizer.hasMoreTokens()) {
                try {
                tokenizer = new StringTokenizer(br.readLine());
                }catch(IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}

转载于:https://www.cnblogs.com/AWCXV/p/10476034.html

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值