要被这题折磨哭了，测试点4死活过不去，找了一个小时也没发现哪里数组越界了，有大佬能帮看一下吗。

#include <cstdio>
#include <algorithm>

using namespace std;

struct Student{
	int grade_1;
	int grade_2;
	int sum_grade;
	int want[7];
	int rank;
	int xh;
}stu[40002];

struct School{
	int minge;
	int num;
	int snum[40002];
	int last;
};

bool cmp(Student s1,Student s2){
	if(s1.sum_grade != s2.sum_grade) return s1.sum_grade>s2.sum_grade;
	if(s1.grade_1 != s2.grade_1) return s1.grade_1 > s2.grade_1;
}

bool cmp2(int a,int b){
	return a < b;
	
}

int main(){
	int n, m, k;
	scanf("%d %d %d", &n, &m, &k);
	
	School sc[m];
	for(int i=0; i<m; i++){
		scanf("%d", &sc[i].minge);
		sc[i].num = 0;
		sc[i].last = -1;
	}
	
	
	for(int i=0; i<n; i++){
		scanf("%d %d", &stu[i].grade_1, &stu[i].grade_2);
		stu[i].sum_grade = stu[i].grade_1 + stu[i].grade_2;
		stu[i].xh = i;
		
		for(int j=0; j<k; j++){
			scanf("%d", &stu[i].want[j]);
		}
	}
	
	sort(stu, stu+n, cmp);
	
	
	
	stu[0].rank = 1;
	for(int i=1; i<n; i++){
		if(stu[i].sum_grade==stu[i-1].sum_grade && stu[i].grade_1==stu[i-1].grade_1){
			stu[i].rank = stu[i-1].rank;
		}else{
			stu[i].rank = i+1;
		}
	}
	
	for(int i=0; i<n; i++){
		for(int j=0; j<k; j++){
			int want = stu[i].want[j];
			int num = sc[want].num;
			int last = sc[want].last;
			if(num<sc[want].minge || (last!=-1 && stu[i].rank==stu[last].rank)){
				sc[want].snum[num] = stu[i].xh;
				sc[want].num++;
				sc[want].last = i;
				break;
			}
		}
	}
	
	for(int i=0 ;i<m; i++){
		int num = sc[i].num;
		if(num > 0){
			sort(sc[i].snum, sc[i].snum+sc[i].num, cmp2);
			for(int j=0; j<num; j++){
				printf("%d", sc[i].snum[j]);
				if(j != num-1){
					printf(" ");
				}
			}
		}
		
		printf("\n");
	}
	
	return 0;
}

.net.mvc做网站的项目结构问题。。。

「已注销」

2个回复