import java.util.Scanner;
public class Main1179 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] yu = new int[n];
int[] shu = new int[n];
int[] ying = new int[n];
int[] total = new int[n];
int[] res = new int[n];
for (int i = 0; i < n; i++) {
yu[i] = in.nextInt();
shu[i] = in.nextInt();
ying[i] = in.nextInt();
total[i] = yu[i] + shu[i] + ying[i];
}
for (int i = 0; i < n; i++) {
int rank = 1;
for (int j = 0; j < n; j++) {
if (total[i] < total[j]) {
rank += 1;
}
}
res[i] = rank;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j && res[i] == res[j]) {
if (yu[i] < yu[j]) {
res[i] += 1;
} else {
res[j] += 1;
}
}
}
}
String[] prints = new String[6];
for (int i = 0; i < res.length; i++) {
if (res[i] <= 5) {
prints[res[i]] = (i + 1) + " " + total[i];
}
}
StringBuilder sb = new StringBuilder();
for (int i = 1; i < prints.length; i++) {
if (prints[i] == null) {
continue;
}
if (i == 1) {
sb.append(prints[i]);
} else {
sb.append('\n' + prints[i]);
}
}
System.out.println(sb);
}
}
0.0分
0 人评分
C语言训练-求矩阵的两对角线上的元素之和 (C语言代码)浏览:3446 |
C语言程序设计教程(第三版)课后习题9.3 (Java代码)浏览:1019 |
WU-蓝桥杯算法提高VIP-Quadratic Equation (C++代码)浏览:1804 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:585 |
2004年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:535 |
Hello, world! (C++代码)浏览:1772 |
模拟计算器 (C++代码)浏览:881 |
C语言程序设计教程(第三版)课后习题3.7 (C语言代码)浏览:727 |
妹子杀手的故事 (C语言代码)浏览:1131 |
第三届阿里中间件性能挑战赛-总决赛亚军比赛攻略浏览:1165 |