积分榜

import sys  class Team:    def __init__(self, name, wins, draws, losses):        self.name = name        self.wins = wins        self.draws = draws        self.losses = losses     def points(self):        return 3 * self.wins + self.draws  lines = sys.stdin.read().split("\n")n = int(lines[0])teams = []for line in lines[1:n + 1]:    name, w, d, l = line.split()    teams.append(Team(name, int(w), int(d), int(l))) # 정렬은 안정적이라 승점·승수가 같으면 입력 차례가 남는다teams.sort(key=lambda t: (t.points(), t.wins), reverse=True)print("\n".join(f"{t.name} {t.points()}" for t in teams))

class Team {  constructor(name, wins, draws, losses) {    this.name = name;    this.wins = wins;    this.draws = draws;    this.losses = losses;  }   points() {    return 3 * this.wins + this.draws;  }} const lines = require("fs").readFileSync(0, "utf8").split("\n");const n = Number(lines[0]);const teams = [];for (let i = 1; i <= n; i++) {  const [name, w, d, l] = lines[i].trim().split(" ");  teams.push(new Team(name, Number(w), Number(d), Number(l)));} // 비교 함수는 음수·0·양수를 돌려줘야 한다. sort는 안정적이라 같으면 입력 차례가 남는다teams.sort((a, b) => b.points() - a.points() || b.wins - a.wins);console.log(teams.map((t) => `${t.name} ${t.points()}`).join("\n"));

import { readFileSync } from "node:fs"; class Team {  readonly name: string;  readonly wins: number;  readonly draws: number;  readonly losses: number;   constructor(name: string, wins: number, draws: number, losses: number) {    this.name = name;    this.wins = wins;    this.draws = draws;    this.losses = losses;  }   points(): number {    return 3 * this.wins + this.draws;  }} const lines: string[] = readFileSync(0, "utf8").split("\n");const n: number = Number(lines[0]);const teams: Team[] = [];for (let i = 1; i <= n; i++) {  const [name, w, d, l] = lines[i].trim().split(" ");  teams.push(new Team(name, Number(w), Number(d), Number(l)));} // 비교 함수는 음수·0·양수를 돌려줘야 한다. sort는 안정적이라 같으면 입력 차례가 남는다teams.sort((a, b) => b.points() - a.points() || b.wins - a.wins);console.log(teams.map((t) => `${t.name} ${t.points()}`).join("\n"));

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Comparator;import java.util.List; class Team {    private final String name;    private final int wins, draws, losses;     Team(String name, int wins, int draws, int losses) {        this.name = name;        this.wins = wins;        this.draws = draws;        this.losses = losses;    }     String getName() { return name; }    int getWins() { return wins; }    int points() { return 3 * wins + draws; }} public class Main {    public static void main(String[] args) throws IOException {        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));        int n = Integer.parseInt(in.readLine().trim());        List<Team> teams = new ArrayList<>();        for (int i = 0; i < n; i++) {            String[] p = in.readLine().trim().split(" ");            teams.add(new Team(p[0], Integer.parseInt(p[1]), Integer.parseInt(p[2]), Integer.parseInt(p[3])));        }         // List.sort(객체)는 안정 정렬이라 같으면 입력 차례가 남는다        teams.sort(Comparator.comparingInt(Team::points).thenComparingInt(Team::getWins).reversed());        StringBuilder out = new StringBuilder();        for (Team t : teams) out.append(t.getName()).append(' ').append(t.points()).append('\n');        System.out.print(out);    }}

using System;using System.Collections.Generic;using System.Linq;using System.Text; class Team{    public string Name { get; }    public int Wins { get; }    public int Draws { get; }    public int Losses { get; }     public Team(string name, int wins, int draws, int losses)    {        Name = name;        Wins = wins;        Draws = draws;        Losses = losses;    }     public int Points() => 3 * Wins + Draws;} class Program{    static void Main()    {        int n = int.Parse(Console.ReadLine());        var teams = new List<Team>();        for (int i = 0; i < n; i++)        {            string[] p = Console.ReadLine().Trim().Split(' ');            teams.Add(new Team(p[0], int.Parse(p[1]), int.Parse(p[2]), int.Parse(p[3])));        }         // List.Sort는 안정 정렬이 아니다. OrderBy는 안정이라 같으면 입력 차례가 남는다        var ranked = teams.OrderByDescending(t => t.Points()).ThenByDescending(t => t.Wins);        var sb = new StringBuilder();        foreach (var t in ranked) sb.Append($"{t.Name} {t.Points()}\n");        Console.Write(sb);    }}

#include <algorithm>#include <iostream>#include <string>#include <utility>#include <vector> class Team {public:    Team(std::string name, int wins, int draws, int losses)        : name_(std::move(name)), wins_(wins), draws_(draws), losses_(losses) {}     const std::string& name() const { return name_; }    int wins() const { return wins_; }    int points() const { return 3 * wins_ + draws_; } private:    std::string name_;    int wins_, draws_, losses_;}; int main() {    std::ios::sync_with_stdio(false);    int n;    std::cin >> n;    std::vector<Team> teams;    for (int i = 0; i < n; i++) {        std::string name;        int w, d, l;        std::cin >> name >> w >> d >> l;        teams.emplace_back(name, w, d, l);    }     // std::sort는 안정 정렬이 아니다. stable_sort라야 같으면 입력 차례가 남는다    std::stable_sort(teams.begin(), teams.end(), [](const Team& a, const Team& b) {        if (a.points() != b.points()) return a.points() > b.points();        return a.wins() > b.wins();    });    for (const Team& t : teams) std::cout << t.name() << ' ' << t.points() << '\n';}