成绩排名表

import sysfrom dataclasses import dataclass  @dataclassclass Student:    name: str    total: int  lines = sys.stdin.read().split("\n")n = int(lines[0])students = []for line in lines[1:n + 1]:    name, *scores = line.split()    students.append(Student(name, sum(map(int, scores)))) students.sort(key=lambda s: (-s.total, s.name))rank = 0for i, s in enumerate(students):    if i == 0 or s.total != students[i - 1].total:        rank = i + 1    print(rank, s.name, s.total)

const lines = require("fs").readFileSync(0, "utf8").split("\n");const n = Number(lines[0]);const students = [];for (let i = 1; i <= n; i++) {  const [name, ...scores] = lines[i].trim().split(" ");  students.push({ name, total: scores.reduce((sum, x) => sum + Number(x), 0) });}// 이름은 글자 코드 순(< 비교). localeCompare는 대소문자를 사람 사전처럼 섞는다students.sort((a, b) => b.total - a.total || (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));const out = [];let rank = 0;students.forEach((s, i) => {  if (i === 0 || s.total !== students[i - 1].total) rank = i + 1;  out.push(`${rank} ${s.name} ${s.total}`);});console.log(out.join("\n"));

import { readFileSync } from "node:fs"; interface Student {  name: string;  total: number;} const lines: string[] = readFileSync(0, "utf8").split("\n");const n: number = Number(lines[0]);const students: Student[] = [];for (let i = 1; i <= n; i++) {  const [name, ...scores] = lines[i].trim().split(" ");  students.push({ name, total: scores.reduce((sum, x) => sum + Number(x), 0) });}students.sort((a, b) => b.total - a.total || (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));const out: string[] = [];let rank = 0;students.forEach((s, i) => {  if (i === 0 || s.total !== students[i - 1].total) rank = i + 1;  out.push(`${rank} ${s.name} ${s.total}`);});console.log(out.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; public class Main {    record Student(String name, int total) {}     public static void main(String[] args) throws IOException {        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));        int n = Integer.parseInt(in.readLine().trim());        List<Student> students = new ArrayList<>();        for (int i = 0; i < n; i++) {            String[] p = in.readLine().trim().split(" ");            int total = Integer.parseInt(p[1]) + Integer.parseInt(p[2]) + Integer.parseInt(p[3]);            students.add(new Student(p[0], total));        }        // String.compareTo는 글자 코드 순이다(대문자가 소문자보다 먼저)        students.sort(Comparator.comparingInt(Student::total).reversed().thenComparing(Student::name));        StringBuilder out = new StringBuilder();        int rank = 0;        for (int i = 0; i < n; i++) {            Student s = students.get(i);            if (i == 0 || s.total() != students.get(i - 1).total()) rank = i + 1;            out.append(rank).append(' ').append(s.name()).append(' ').append(s.total()).append('\n');        }        System.out.print(out);    }}

using System;using System.Collections.Generic;using System.Linq; record Student(string Name, int Total); class Program{    static void Main()    {        int n = int.Parse(Console.ReadLine());        var students = new List<Student>();        for (int i = 0; i < n; i++)        {            string[] p = Console.ReadLine().Trim().Split(' ');            students.Add(new Student(p[0], p.Skip(1).Sum(int.Parse)));        }        // 기본 문자열 비교는 문화권 규칙을 따를 수 있어 글자 코드 순(Ordinal)을 밝혀 준다        var sorted = students.OrderByDescending(s => s.Total).ThenBy(s => s.Name, StringComparer.Ordinal).ToList();        int rank = 0;        for (int i = 0; i < sorted.Count; i++)        {            if (i == 0 || sorted[i].Total != sorted[i - 1].Total) rank = i + 1;            Console.WriteLine($"{rank} {sorted[i].Name} {sorted[i].Total}");        }    }}

#include <algorithm>#include <iostream>#include <string>#include <vector> struct Student {    std::string name;    int total;}; int main() {    int n;    std::cin >> n;    std::vector<Student> students;    for (int i = 0; i < n; i++) {        std::string name;        int k, e, m;        std::cin >> name >> k >> e >> m;        students.push_back({name, k + e + m});    }    std::sort(students.begin(), students.end(), [](const Student& a, const Student& b) {        if (a.total != b.total) return a.total > b.total;        return a.name < b.name;    });    int rank = 0;    for (int i = 0; i < n; i++) {        if (i == 0 || students[i].total != students[i - 1].total) rank = i + 1;        std::cout << rank << ' ' << students[i].name << ' ' << students[i].total << '\n';    }}

#include <stdio.h>#include <stdlib.h>#include <string.h> struct Student {    char name[11];    int total;}; static int by_total_then_name(const void *pa, const void *pb) {    const struct Student *a = pa, *b = pb;    if (a->total != b->total) return b->total - a->total;    return strcmp(a->name, b->name); /* 글자 코드 순 */} int main(void) {    static struct Student s[1000];    int n;    scanf("%d", &n);    for (int i = 0; i < n; i++) {        int k, e, m;        scanf("%10s %d %d %d", s[i].name, &k, &e, &m);        s[i].total = k + e + m;    }    qsort(s, n, sizeof s[0], by_total_then_name);    int rank = 0;    for (int i = 0; i < n; i++) {        if (i == 0 || s[i].total != s[i - 1].total) rank = i + 1;        printf("%d %s %d\n", rank, s[i].name, s[i].total);    }    return 0;}

// 크레이콘에는 클래스가 없어서 학생 한 명을 사전 하나(이름·합계)로 묶는다n = 控制台.读行().转数字();students = [];循环 (i = 0; i < n; i++){    p = 控制台.读行().去空白().分割();    s = 字典();    s["name"] = p[0];    s["total"] = p[1].转数字() + p[2].转数字() + p[3].转数字();    students.添加(s);}students.排序(합계순);rank = 0;循环 (i = 0; i < n; i++){    s = students[i];    如果 (i == 0 || s["total"] != students[i - 1]["total"])    {        rank = i + 1;    }    控制台.输出(rank + " " + s["name"] + " " + s["total"]);} // 합계가 큰 것 먼저, 같으면 이름의 글자 코드 순합계순(앞, 뒤){    如果 (앞["total"] != 뒤["total"])    {        返回 뒤["total"] - 앞["total"];    }    如果 (앞["name"] < 뒤["name"])    {        返回 -1;    }    返回 1;}