帮我看看(在线等急)
查看原帖
帮我看看(在线等急)
1245542
like_1999楼主2024/3/31 14:16
#include<bits/stdc++.h> 
using namespace std;
int main()
{
	long long int m, z;
	cin >> m;
	long long int n[m], b[m], v[m], c[m], x[m];
	for (int q = 0 ; q < m ; q++) {
		cin >> n[q] >> b[q] >> v[q];
		c[q] = n[q] + b[q] + v[q];
		x[q] = q + 1;
	}
	for (int q = 0 ; q < m ; q++) {
		for (int w = 0 ; w < m ; w++) {
			if (c[w] < c[q]) {
				swap(c[q] , c[w]);
				swap(x[q] , x[w]);
			}
		}
	}
	for (int q = 0 ; q < 5 ; q++) {
		if (c[q] == c[q + 1] && x[q] > x[q + 1]){
			cout << x[q + 1] << " " << c[q + 1] << endl;
			cout << x[q] << " " << c[q] << endl;
			q++;
		}
		else {
			cout << x[q] << " " << c[q] << endl;
		}
	} 
	return 0;
}
2024/3/31 14:16
加载中...