fork download
copy 
  1. import java.io.*;
  2. import java.util.Arrays;
  3.  
  4. public class Main {
  5.     public static void main(String[] args) throws IOException {
  6.         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  7.         BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
  8.         int T = Integer.parseInt(br.readLine());
  9.         while (T-- > 0) {
  10.             String[] line = br.readLine().split(" ");
  11.             int n = Integer.parseInt(line[0]);
  12.             int q = Integer.parseInt(line[1]);
  13.             int[] a = new int[n];
  14.             line = br.readLine().split(" ");
  15.             for (int i = 0; i < n; i++) {
  16.                 a[i] = Integer.parseInt(line[i]);
  17.             }
  18.             Arrays.sort(a);
  19.             long[] preSum = new long[n + 1];
  20.             for (int i = 1; i <= n; i++) {
  21.                 preSum[i] = preSum[i - 1] + a[i - 1];
  22.             }
  23.             long currentMin = Long.MAX_VALUE;
  24.             while (q-- > 0) {
  25.                 line = br.readLine().split(" ");
  26.                 int op = Integer.parseInt(line[0]);
  27.                 if (op == 1) {
  28.                     int v = Integer.parseInt(line[1]);
  29.                     if (v < currentMin) {
  30.                         currentMin = v;
  31.                     }
  32.                 } else {
  33.                     if (currentMin == Long.MAX_VALUE) {
  34.                         bw.write(preSum[n] + "\n");
  35.                     } else {
  36.                         int pos = bisectRight(a, (int) currentMin);
  37.                         long sum = preSum[pos] + (n - pos) * currentMin;
  38.                         bw.write(sum + "\n");
  39.                     }
  40.                 }
  41.             }
  42.         }
  43.         bw.flush();
  44.     }
  45.  
  46.     private static int bisectRight(int[] a, int key) {
  47.         int low = 0, high = a.length;
  48.         while (low < high) {
  49.             int mid = (low + high) >>> 1; // 无符号右移避免溢出
  50.             if (a[mid] > key) {
  51.                 high = mid;
  52.             } else {
  53.                 low = mid + 1;
  54.             }
  55.         }
  56.         return low;
  57.     }
  58. }
Success #stdin #stdout 0.09s 55784KB
comments (?)
stdin
copy 
1
5 3
1 2 4 5 3
2 
1 2
2
stdout
copy 
15
9
https://ideone.com/htyQlq
language:
Java (HotSpot 12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!