静态代码扫描服务

题目解析

简单的贪心思维逻辑题，解析请看代码注释。

JS算法源码

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
  const m = parseInt(await readline());
  const f = (await readline()).split(" ").map(Number);
  const s = (await readline()).split(" ").map(Number);

  // count用于保存每个文件出现的次数
  const count = {};
  // size用于保存文件的大小，即扫描成本
  const size = {};

  for (let i = 0; i < f.length; i++) {
    // k是文件标识
    const k = f[i];

    count[k] ? count[k]++ : (count[k] = 1);

    if (!size[k]) {
      size[k] = s[i];
    }
  }

  let ans = 0;
  for