1092 最好吃的月饼 (20 分)(算法分析+代码实现)

1092 最好吃的月饼 (20 分)

题目链接

算法分析

开一个月饼结构体,然后结构体排序就好.

代码实现

#include<bits/stdc++.h>
using namespace std;
#define N 1005
struct mooncake{
	int id, sales;
}mk[N];
bool cmp(const mooncake a, const mooncake b){
	return a.sales == b.sales ? a.id < b.id : a.sales > b.sales;
}
int main(){
	int n, m, single_sale;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; ++ i){
		for(int j = 1; j <= n; ++ j){
			scanf("%d", &single_sale);
			mk[j].id = j;
			mk[j].sales += single_sale;
		}
	}
	bool flag = 1;
	sort(mk + 1, mk + n + 1, cmp);
	printf("%d\n", mk[1].sales);
	for(int i = 1; i <= n; ++ i)
		if(mk[i].sales == mk[1].sales){
			if(flag){
				printf("%d", mk[i].id);
				flag = 0;
			}
			else printf(" %d", mk[i].id);
		}
		else break;
	return 0;
}