优秀学员统计

题目解析

简单排序题。需要注意的是，排序要素需要记录每个员工第一次打卡日期，作为第二优先级排序。

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 n = parseInt(await readline());

  await readline();

  // key记录员工id, value记录员工打卡天数
  const freq = {};
  // key记录员工id，value记录员工第一次打卡是哪天
  const first = {};

  for (let i = 0; i < 30; i++) {
    const ids = (await readline()).split(" ");

    for (let id of ids) {
      if (freq[id] == undefined) {
        freq[id] = 0;
      }

      freq[id]++;

      if (first[id] == undefined) {
        first[id]