Package

Source Code of Solution

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Collections;

class Solution {
  static InputStream is;
  static PrintWriter out;
  static String INPUT = "";
 
  static void solve()
  {
    long ite = nl();
    for(long T=0;T<ite;T++)
    {
      int m = ni();
      int n = ni();
      m--;n--;
      Long a[] = new Long[m];
      Long b[] = new Long[n];
      Long aa[] = new Long[m];
      Long bb[] = new Long[n];
      for(int i=0;i<m;i++)
        a[i] = nl();
      for(int i=0;i<n;i++)
        b[i] = nl();
      Arrays.sort(a, Collections.reverseOrder());
      Arrays.sort(b, Collections.reverseOrder());
      aa[m-1] = a[m-1];
      bb[n-1] = b[n-1];
      for(int i=m-2;i>=0;i--)
        aa[i] = a[i] + aa[i+1];
      for(int i=n-2;i>=0;i--)
        bb[i] = b[i] + bb[i+1];
      long x = 1, y = 1, sol = 0;
      int i=0,j=0;
      for(;i<m && j<n;)
      {
        if(aa[i] > bb[j])
        {
          sol += a[i]*x;
          y++;
          i++;
        }
        else
        {
          sol += b[j]*y;
          x++;
          j++;
        }
      }
      while(i<m)
      {
        sol += a[i]*x;
        i++;
      }
      while(j<n)
      {
        sol += b[j]*y;
        j++;
      }
      System.out.println(sol);
    }
  }
 
  public static void main(String[] args) throws Exception
  {
    long S = System.currentTimeMillis();
    is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
    out = new PrintWriter(System.out);
   
    solve();
    out.flush();
    long G = System.currentTimeMillis();
    tr(G-S+"ms");
  }
 
  private static boolean eof()
  {
    if(lenbuf == -1)return true;
    int lptr = ptrbuf;
    while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
   
    try {
      is.mark(1000);
      while(true){
        int b = is.read();
        if(b == -1){
          is.reset();
          return true;
        }else if(!isSpaceChar(b)){
          is.reset();
          return false;
        }
      }
    } catch (IOException e) {
      return true;
    }
  }
 
  private static byte[] inbuf = new byte[1024];
  static int lenbuf = 0, ptrbuf = 0;
 
  private static int readByte()
  {
    if(lenbuf == -1)throw new InputMismatchException();
    if(ptrbuf >= lenbuf){
      ptrbuf = 0;
      try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
      if(lenbuf <= 0)return -1;
    }
    return inbuf[ptrbuf++];
  }
 
  private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
  private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
 
  private static double nd() { return Double.parseDouble(ns()); }
  private static char nc() { return (char)skip(); }
 
  private static String ns()
  {
    int b = skip();
    StringBuilder sb = new StringBuilder();
    while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }
 
  private static char[] ns(int n)
  {
    char[] buf = new char[n];
    int b = skip(), p = 0;
    while(p < n && !(isSpaceChar(b))){
      buf[p++] = (char)b;
      b = readByte();
    }
    return n == p ? buf : Arrays.copyOf(buf, p);
  }
 
  private static char[][] nm(int n, int m)
  {
    char[][] map = new char[n][];
    for(int i = 0;i < n;i++)map[i] = ns(m);
    return map;
  }
 
  private static int[] na(int n)
  {
    int[] a = new int[n];
    for(int i = 0;i < n;i++)a[i] = ni();
    return a;
  }
 
  private static int ni()
  {
    int num = 0, b;
    boolean minus = false;
    while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
    if(b == '-'){
      minus = true;
      b = readByte();
    }
   
    while(true){
      if(b >= '0' && b <= '9'){
        num = num * 10 + (b - '0');
      }else{
        return minus ? -num : num;
      }
      b = readByte();
    }
  }
 
  private static long nl()
  {
    long num = 0;
    int b;
    boolean minus = false;
    while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
    if(b == '-'){
      minus = true;
      b = readByte();
    }
   
    while(true){
      if(b >= '0' && b <= '9'){
        num = num * 10 + (b - '0');
      }else{
        return minus ? -num : num;
      }
      b = readByte();
    }
  }
 
  private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
TOP

Related Classes of Solution

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.