首页 > 试题广场 >

德才论 (25)

[编程题]德才论 (25)
  • 热度指数:38231 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32M,其他语言64M
  • 算法知识视频讲解
宋代史学家司马光在《资治通鉴》中有一段著名的“德才论”:“是故才德全尽谓之圣人,才德兼亡谓之愚人,德胜才谓之君子,才胜德谓之
小人。凡取人之术,苟不得圣人,君子而与之,与其得小人,不若得愚人。”

现给出一批考生的德才分数,请根据司马光的理论给出录取排名。

输入描述:
输入第1行给出3个正整数,分别为:N(<=105),即考生总数;L(>=60),为录取最低分数线,即德分和才分均不低于L的考生才有资格
被考虑录取;H(<100),为优先录取线——德分和才分均不低于此线的被定义为“才德全尽”,此类考生按德才总分从高到低排序;才分不到
但德分到线的一类考生属于“德胜才”,也按总分排序,但排在第一类考生之后;德才分均低于H,但是德分不低于才分的考生属于“才德兼
亡”但尚有“德胜才”者,按总分排序,但排在第二类考生之后;其他达到最低线L的考生也按总分排序,但排在第三类考生之后。

随后N行,每行给出一位考生的信息,包括:准考证号、德分、才分,其中准考证号为8位整数,德才分为区间[0, 100]内的整数。数字间以空格分隔。


输出描述:
输出第1行首先给出达到最低分数线的考生人数M,随后M行,每行按照输入格式输出一位考生的信息,考生按输入中说明的规则从高到低排序。当某类考生中有多人
总分相同时,按其德分降序排列;若德分也并列,则按准考证号的升序输出。
示例1

输入

14 60 80
10000001 64 90
10000002 90 60
10000011 85 80
10000003 85 80
10000004 80 85
10000005 82 77
10000006 83 76
10000007 90 78
10000008 75 79
10000009 59 90
10000010 88 45
10000012 80 100
10000013 90 99
10000014 66 60

输出

12
10000013 90 99
10000012 80 100
10000003 85 80
10000011 85 80
10000004 80 85
10000007 90 78
10000006 83 76
10000005 82 77
10000002 90 60
10000014 66 60
10000008 75 79
10000001 64 90
按照先分组再排序的思路做的,排序使用快速排序。
感觉迭代起来空间性能有些差,对于数据量不大的情况下,

时间性能上也没有多少优势。
没有具体计算,求大神帮忙分析一下。

算法:
1、遍历数据,分为四组,并获得每组大小;
2、各组快速排序,大小比较规则设为Bigger()函数;
3、依次输出各组;

#include<iostream>
#include<string>
#include<vector>

using namespace std;


class Rec
{
public:
	unsigned number;
	unsigned de;
	unsigned cai;
	unsigned total;
	void Input(void){ cin >> number >> de >> cai; total = de + cai; }
	void Output(void){ cout << number << " " << de << " " << cai << endl; }
};
void Sort(int low, int high, vector<Rec> &Grade);
unsigned QuickSort(int begin, int end, vector<Rec> &Grade);
bool Bigger(Rec &Item1, Rec &Item2);



bool Bigger(Rec &Item1, Rec &Item2)
{
	if (Item1.total > Item2.total)
		return true;
	else if (Item1.total == Item2.total)
	{
		if (Item1.de > Item2.de)
			return true;
		else if (Item1.de == Item2.de)
		{
			if (Item1.number <= Item2.number)
				return true;
		}
	}
	return false;
}

void Sort(int low, int high, vector<Rec> &Grade)
{
	int pos;
	if (low < high)
	{
		pos = QuickSort(low, high, Grade);
		Sort(low, pos - 1, Grade);
		Sort(pos + 1, high, Grade);
	}
}

unsigned QuickSort(int begin, int end, vector<Rec> &Grade)
{
	int pos = begin;
	Rec Temp = Grade[pos];

	while (end > begin)
	{
		while (end > begin && Bigger(Temp,Grade[end]))			//#1:修改Bigger参数weizhi
		{
			--end;
		}
		Grade[pos] = Grade[end];
		pos = end;

		while (end > begin && Bigger(Grade[begin],Temp))		//#1:修改Bigger参数weizhi
		{
			++begin;
		}
		Grade[pos] = Grade[begin];
		pos = begin;
	}
	Grade[pos] = Temp;
	return pos;
}

int main(void)
{
	unsigned N, L, H;

	cin >> N >> L >> H;

//	N = 20; L = 60; H = 80;

	vector<Rec> Grade(N);
	vector<vector<Rec>> Group(4);
	vector<int> Cnt(4, 0);
	int PassCnt = 0;

	for (unsigned i = 0; i != N; i++)
		Grade[i].Input();
/*
	for (unsigned i = 0; i != N; i++)
	{
		Grade[i].number = i + 1;
		Grade[i].de = 100 - (i + 1) * 3;
		Grade[i].cai = 100 - (i + 1) * 2;
		Grade[i].Output();
	}
*/
	for (unsigned i = 0; i != N; i++)
	{
		if (Grade[i].de >= L && Grade[i].cai >= L)
		{
			if (Grade[i].de >= H)
			{
				if (Grade[i].cai >= H)
				{
					Group[0].push_back(Grade[i]);
					++Cnt[0];
				}
				else 
				{
					Group[1].push_back(Grade[i]);
					++Cnt[1];
				}
			}
			else if (Grade[i].de >= Grade[i].cai)
			{
				Group[2].push_back(Grade[i]);
				++Cnt[2];
			}
			else
			{
				Group[3].push_back(Grade[i]);
				++Cnt[3];
			}
		}
	}
	for (unsigned i = 0; i != 4; i++)
	{
		PassCnt += Cnt[i];

	}
	cout << PassCnt << endl;
	for (unsigned i = 0; i != 4; i++)
	{
		if (Cnt[i] > 1)
		{
			Sort(0, Cnt[i] - 1, Group[i]);
		}
		for (unsigned j = 0; j != Cnt[i]; j++)
			Group[i][j].Output();
	}
}

编辑于 2015-09-17 21:04:28 回复(0)
#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<stdlib.h>
/*
分成5类,按类快速排序(或者冒泡,可能更快),每类同学再按总分冒泡排序,如果总分相同,按德排序
如果德相同,按准考证升序排序

编了整整1天,满分时的心情简直比考研录取还高兴
*/

using namespace std;
int cmpTag(const void*, const void*);
int cmpTotal(const void*, const void*);
int cmpStuID(const void*, const void*);
int cmpDe(const void*, const void*);
void cinExample(int*, int*, int*);
void printStu();
void fenLei(int, int, int);
void FinalSort(int, int);
void swap(int, int);
typedef struct student
{
    long stuID;
    int de;
    int cai;
    int total;
    int tag;
}student;
student stu[100000];
int count0 = 0, countx[4] = { 0, 0, 0, 0 };
int main()
{
    
    int N, L, H;
    cinExample(&N, &L, &H);
    //inputExampleFromFile(&N, &L, &H);    测试用
    qsort(stu, N, sizeof(stu[0]), cmpTag);
    qsort(stu, countx[0], sizeof(stu[0]), cmpTotal);
    qsort(&stu[countx[0]], countx[1], sizeof(stu[0]), cmpTotal);
    qsort(&stu[countx[0] + countx[1]], countx[2], sizeof(stu[0]), cmpTotal);
    qsort(&stu[countx[0]] + countx[2] + countx[1], countx[3], sizeof(stu[0]), cmpTotal);
    FinalSort(0, count0);
    printStu();
}
void fenLei(int i, int L, int H)
{
    if (stu[i].de >= H && stu[i].cai >= H)
    {
        stu[i].tag = 1;
        countx[0]++;
        count0++;
    }
    else if (stu[i].de >= H && stu[i].cai >= L)
    {
        stu[i].tag = 2;
        countx[1]++;
        count0++;
    }
    else if (stu[i].de >= L && stu[i].cai >= L && stu[i].de >= stu[i].cai)
    {
        stu[i].tag = 3;
        countx[2]++;
        count0++;
    }
    else if (stu[i].de >= L && stu[i].cai >= L)
    {
        stu[i].tag = 4;
        countx[3]++;
        count0++;
    }
    else
        stu[i].tag = 5;
}
void FinalSort(int start, int end)
{
    int i, j;
    for (j = start; j < end; j++)
    {
        if (stu[j].total == stu[j + 1].total && stu[j].tag == stu[j + 1].tag)
        {
            
            for (i = j + 1; stu[j].total == stu[i].total && stu[j].tag == stu[i].tag; i++);
            qsort(&stu[j], i - j, sizeof(stu[0]), cmpDe);
            j = i - 1;
        }
    }
    for (j = start; j < end; j++)
    {
        if (stu[j].total == stu[j + 1].total && stu[j].tag == stu[j + 1].tag
            && stu[j].de == stu[j + 1].de)
        {
            for (i = j + 1; stu[j].total == stu[i].total && stu[j].tag == stu[i].tag
                && stu[j].de == stu[i].de; i++);
                qsort(&stu[j], i - j, sizeof(stu[0]), cmpStuID);
            j = i - 1;
        }
    }
    
}
void swap(int i, int j)
{
    student temp;
    temp = stu[i];
    stu[i] = stu[j];
    stu[j] = temp;
}
int cmpTag(const void *a, const void *b)
{
    return (*(student *)a).tag - (*(student *)b).tag;
}
int cmpTotal(const void *a, const void *b)
{
    return (*(student *)b).total - (*(student *)a).total;
}
int cmpStuID(const void *a, const void *b)
{
    if ((*(student *)a).de == (*(student *)b).de)
    {
        return (*(student *)a).stuID > (*(student *)b).stuID;
    }
    else
    {
        return -1;
    }
}
int cmpDe(const void *a, const void *b)
{
    return (*(student *)b).de - (*(student *)a).de;
}
void cinExample(int *N, int *L, int *H)
{
    cin >> *N >> *L >> *H;
    for (int i = 0; i < *N; i++)
    {
        cin >> stu[i].stuID >> stu[i].de >> stu[i].cai;
        stu[i].total = stu[i].de + stu[i].cai;
        fenLei(i, *L, *H);
    }
}
void printStu()
{
    cout << count0 << "\n";
    for (int i = 0; i < count0; i++)
    {
        cout << stu[i].stuID << " " << stu[i].de << " " << stu[i].cai << "\n";
    }
}

发表于 2018-04-04 17:04:33 回复(0)
将达线考生放入不同的数组中,再分别排序,再按不同的顺序依次输出数组

#include <iostream> #include <list>  using namespace std; class student{ public: int number; int de; int ca; bool operator < (student & s) { if (s.de + s.ca == de + ca) { if (s.de == de) return s.number > number; else  return s.de < de;
        } else { return s.de + s.ca < de + ca;
        }
    }
}; int main() { list<student> s, s1, s2, s3; int N, L, H, count = 0;
    cin >> N >> L >> H; for (int i = 0; i < N; ++i) { student student1;
        cin >> student1.number >> student1.de >> student1.ca; if (student1.de >= L && student1.ca >= L) {
            count++; if (student1.de >= H && student1.ca >= H) {
                s1.insert(s1.begin(), student1);
            } else if (student1.de >= H && student1.ca < H) {
                s2.insert(s2.begin(), student1);
            } else if (student1.ca <= student1.de) {
                s3.insert(s3.begin(), student1);
            } else {
                s.insert(s.begin(), student1);
            }
        }
    }
    s1.sort();
    s2.sort();
    s3.sort();
    s.sort();
    cout << count << endl; for (student student2 : s1) {
        cout << student2.number << " " << student2.de << " " << student2.ca << endl;
    } for (student student2 : s2) {
        cout << student2.number << " " << student2.de << " " << student2.ca << endl;
    } for (student student2 : s3) {
        cout << student2.number << " " << student2.de << " " << student2.ca << endl;
    } for (student student2 : s) {
        cout << student2.number << " " << student2.de << " " << student2.ca << endl;
    } return 0;
}
编辑于 2017-01-05 20:43:46 回复(2)
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct student{
    string s;
    int d;
    int c;
};
bool compare(student a, student b){
    if((a.d+a.c)>(b.d+b.c))
        return true;
    if((a.d+a.c)==(b.d+b.c) && a.d>b.d)
        return true;
    if(a.d==b.d && a.c==b.c && a.s<b.s)
        return true;
    return false;
}
int main(){   
 
    int N,L,H;
    cin>>N>>L>>H;

    student temp;
    vector<student> stu;
    while(cin>>temp.s>>temp.d>>temp.c)
        stu.push_back(temp);
    
    vector<student> result;
    int count=0;
    for(auto i:stu){
       if(i.d>=L&&i.c>=L){
           count++;
           result.push_back(i);
       }
    }
    cout<<count<<endl;
    
    sort(result.begin(),result.end(),compare);
    for(int i=0;i<result.size();i++)
    	if(result[i].d>=H&&result[i].c>=H)
         cout<<result[i].s<<" "<<result[i].d<<" "<<result[i].c<<endl;
	for(int i=0;i<result.size();i++)
    	if(result[i].d>=H&&result[i].c<H&&result[i].c>=L)
         cout<<result[i].s<<" "<<result[i].d<<" "<<result[i].c<<endl;
	for(int i=0;i<result.size();i++)
   	 if(result[i].d<H&&result[i].d>=L&&result[i].c<H&&result[i].c>=L&&result[i].d>=result[i].c)
        cout<<result[i].s<<" "<<result[i].d<<" "<<result[i].c<<endl;
	for(int i=0;i<result.size();i++)
    	if(result[i].d<H&&result[i].d>=L&&result[i].c>=L&&result[i].d<result[i].c)
        cout<<result[i].s<<" "<<result[i].d<<" "<<result[i].c<<endl;
    
    
    
}

发表于 2015-08-04 10:03:15 回复(0)
import java.util.Comparator;
import java.util.Scanner;
import java.util.TreeSet;
 
public class PoliticalDemo {
	 static class student{
	    int id,de,cai,total;
		public student(int id, int de, int cai) {
			super();
			this.id = id;
			this.de = de;
			this.cai = cai;
			this.total = cai+de;
		}	  
	  }
	 
  public static void main(String[] args) {
	 Scanner in = new Scanner(System.in);

	  Comparator<student> c =new Comparator<student>() {
		  @Override
			public int compare(student s1, student s2) {
				 if(s1.total!=s2.total){
					 return s2.total-s1.total;
				 }else if(s1.de!=s2.de){
					 return s2.de-s1.de;
				 }else{
					 return s1.id-s2.id;
				 }		}
	};
	TreeSet<student> tree1 = new TreeSet<>(c);
     TreeSet<student> tree2 = new TreeSet<>(c);
     TreeSet<student> tree3 = new TreeSet<>(c);
     TreeSet<student> tree4 = new TreeSet<>(c);
     
		 int n = in.nextInt();
		 int l = in.nextInt();
		 int h = in.nextInt();		 
		 while(n>0){
			 int id = in.nextInt();
			 int de = in.nextInt();
			 int cai =in.nextInt();					 
		     student s = new student(id,de,cai);	 			 
			 if(s.cai>=l&&s.de>=l){
				 if(s.cai>=h&&s.de>=h){
					 	tree1.add(s);
				 		}
				 		else if(s.de>=h){
		    	        tree2.add(s);
				  }else if(s.de>=s.cai){
					    tree3.add(s);
				  }else{
					    tree4.add(s);
				  }
			 }
			 n--;
		 }
		 System.out.println(tree1.size()+tree2.size()+tree3.size()+tree4.size());
	     for(student s :tree1){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree2){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree3){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }
	     for(student s :tree4){
	    	 System.out.println(s.id+" "+s.de+" "+s.cai);
	     }	 		 

}
}



发表于 2017-04-08 12:40:01 回复(5)

我写的好复杂呀。。。还是得多多磨炼

#include <bits/stdc++.h>
using namespace std;
int n,l,h;
typedef struct {
	int no;
	int moral;
	int talent;
} Student;
bool cmp(Student a,Student b) {
	if(a.moral>=h&&a.talent>=h) {
		if(b.moral>=h&&b.talent>=h)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else return true;
	} else if(a.moral>=h&&a.talent<h) {
		if(b.moral>=h&&b.talent<h)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else if(b.moral>=h&&b.talent>=h)
			return false;
		else return true;
	} else if(a.moral<h&&a.talent<h&&a.moral>=a.talent) {
		if(b.moral<h&&b.talent<h&&b.moral>=b.talent)
			if(a.moral+a.talent!=b.moral+b.talent)
				return a.moral+a.talent>b.moral+b.talent;
			else if(a.moral!=b.moral) return a.moral>b.moral;
			else return a.no<b.no;
		else if((b.moral>=h&&b.talent<h)||(b.moral>=h&&b.talent>=h))
			return false;
		else return true;
	} else {
		if((b.moral>=h&&b.talent<h)||(b.moral>=h&&b.talent>=h)||(b.moral<h&&b.talent<h&&b.moral>=b.talent)) 
			return false;
		else if(a.moral+a.talent!=b.moral+b.talent)
			return a.moral+a.talent>b.moral+b.talent;
		else if(a.moral!=b.moral) return a.moral>b.moral;
		else return a.no<b.no;

	}
}
int main() {
	int x,y,z;
	cin>>n>>l>>h;
	vector<Student> students;
	for(int i=0; i<n; ++i) {

		cin>>x>>y>>z;
		if(y<l||z<l) continue;
		Student stu;
		stu.no=x;
		stu.moral=y;
		stu.talent=z;
		students.push_back(stu);
		//cin>>student[i].no>>student[i].moral>>student[i].talent;
	}
	sort(students.begin(),students.end(),cmp);
	cout<<students.size()<<endl;
	for(int i=0; i<students.size(); ++i) {
		cout<<students[i].no<<" "<<students[i].moral<<" "<<students[i].talent<<endl;
	}

	return 0;
}


发表于 2020-04-23 12:22:19 回复(0)
为什么总是提示超时
package Algorithm.chapter03.section01;

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt(), L = sc.nextInt(), H = sc.nextInt();
        LinkedList<Student> list = new LinkedList<>();
        for (int i = 0; i < N; i++) {
            list.add(new Student(sc.nextInt(),sc.nextInt(),sc.nextInt()));
        }

        for (int i = 0; i < list.size(); i++) {
            Student student = list.get(i);
            if(student.getCai()<60||student.getDe()<60)
                list.remove(student);
        }

        for (Student student : list) {
            if(student.getDe()>=H && student.getCai() >= H)
                student.setLevel(0);
            else if(student.getDe()>=H && student.getCai() < H)
                student.setLevel(1);
            else if(student.getDe() >= student.getCai())
                student.setLevel(2);
            else
                student.setLevel(3);
        }

        list.sort(new Comparator<Student>() {
            public int compare(Student s, Student t) {
                 if(s.getLevel()==t.getLevel()){
                     if((t.getDe()+t.getCai())==(s.getDe()+s.getCai())) // 如果成绩相等则 按照 德成绩>序号进行排序
                         return (t.getDe()-s.getDe()==0)?s.getNum()-t.getNum():t.getDe()-s.getDe();
                     else
                         return (t.getDe()+t.getCai())-(s.getDe()+s.getCai()); // (成绩)s 比 t 大,排前面,如果相等按照序号排序
                 }
                 return s.getLevel()-t.getLevel(); // s 比 t 等级高排前面
            }
        });

        for (Student student : list) {
            System.out.println(student.getNum()+" "+student.getDe()+" "+student.getCai());
        }
    }

    private static class Student{
        private int num;
        private int de;
        private int cai;
        private int level;


        public Student(int num, int de, int cai) {
            this.num = num;
            this.de = de;
            this.cai = cai;
        }

        public void setLevel(int level) {
            this.level = level;
        }

        public int getLevel() {
            return level;
        }

        public int getNum() {
            return num;
        }

        public int getDe() {
            return de;
        }

        public int getCai() {
            return cai;
        }
    }
}


发表于 2020-04-07 00:20:01 回复(0)
//借助top 1的等级制
#include<bits/stdc++.h>
using namespace std;
struct P{
    string id;
    int d;
    int c;
    int l;
};
bool cmp(P a,P b){
	if(a.l == b.l && a.c+a.d == b.c+b.d){
		if(a.d == b.d)return a.id<b.id;
		else return a.d>b.d;
	}else if(a.l == b.l)return a.c+a.d>b.c+b.d;
	else return a.l<b.l;
}
int main(){
    int N,H,L;
    while(cin>>N>>L>>H){
        P a[N];
        int cnt = 0;
        for(int i=0;i<N;++i){
        	cin>>a[i].id>>a[i].d>>a[i].c;
        	if(a[i].d>=H&&a[i].c>=H)a[i].l = 1;
        	else if(a[i].d>=H&&a[i].c>=L)a[i].l = 2;
        	else if(a[i].d>=L&&a[i].c>=L&&a[i].d>=a[i].c)a[i].l = 3;
        	else if(a[i].d>=L&&a[i].c>=L)a[i].l = 4;
        	else a[i].l = 5;
        	if(a[i].l!=5)cnt++;
		}
        cout<<cnt<<endl;
        sort(a,a+N,cmp);
        for(int i=0;i<cnt;++i){
        		cout<<a[i].id<<' '<<a[i].d<<' '<<a[i].c<<endl;
		}
    }
}

发表于 2019-09-11 21:33:54 回复(0)
这样子的题目切记细心分析,步步为营就可以了


#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Stu{
    bool operator<(const Stu& b)
    {
        if ((this->c + this->d) != (b.c + b.d))
            return ((this->c + this->d) >(b.c + b.d));
        else
            return (this->d == b.d)? (this->id < b.id) : (this->d > b.d);
    }
    int id;
    int d;
    int c;
};
void print(const Stu& s)
{
    cout << s.id << " " << s.d << " " << s.c << " "<< endl;
}

int main()
{
    int N,L,H,cnt = 0;
    cin >> N >> L >> H;
    vector<Stu> v[4];
    for (int i = 0; i < N; i++)
    {
        Stu Info;
        cin >> Info.id >> Info.d >> Info.c;
        if (Info.d >= L && Info.c >= L)
        {
            if (Info.d >= H && Info.c >= H)
                v[0].push_back(Info);
            else if (Info.d >= H && Info.c < H)
                v[1].push_back(Info);
            else if (Info.d < H && Info.c < H && Info.d >= Info.c)
                v[2].push_back(Info);
            else
                v[3].push_back(Info);
            cnt++;
        }    
    }
    cout << cnt << endl;
    for (int i = 0; i < 4; i++)
    {
        sort(v[i].begin(), v[i].end());
        for (auto e : v[i])print(e);
    }
    return 0;
}

发表于 2019-06-23 21:38:30 回复(0)
// 思路,sort排序按照结构体的相关结构即可。
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
// 第一类 德分和才分均不低于此线的被定义为“才德全尽”,此类考生按德才总分从高到低排序;
// 才分不到但德分到线的一类考生属于“德胜才”,也按总分排序,但排在第一类考生之后;
// 德才分均低于H,但是德分不低于才分的考生属于“才德兼亡”但尚有“德胜才”者,按总分排序,
// 但排在第二类考生之后;
// 其他达到最低线L的考生也按总分排序,但排在第三类考生之后。
// 当某类考生中有多人总分相同时,按其德分降序排列;
// 若德分也并列,则按准考证号的升序输出。
typedef struct
{
    string id;
    int scoreDe;
    int scoreCai;
    int sumScore;
}student;
int ChooseClass(student &s, int H, int L)
{
    int class_student = 0;
    if(s.scoreCai >= H && s.scoreDe >= H)
    {
        class_student = 1;
    }
    else if(s.scoreCai >= L && s.scoreDe >= H)
    {
        class_student = 2;
    }
    else if(s.scoreCai >= L && s.scoreDe >= L && s.scoreCai <= s.scoreDe)
    {
        class_student = 3;
    }
    else if(s.scoreCai >= L && s.scoreDe >= L)
    {
        class_student = 4;
    }
    else
    {
        class_student = 5;
    }
    s.sumScore = s.scoreCai + s.scoreDe;
    return class_student;
}

bool cmp(student &a ,student &b)
{     if (a.sumScore > b.sumScore)     {         return true;     }
    else if(a.sumScore == b.sumScore)
    {
        if(a.scoreDe > b.scoreDe)
        {
            return true;
        }
        else if(a.scoreDe == b.scoreDe)
        {
            if(a.id < b.id)
            {
                return true;
            }
        }
    }     return false ;
}
int main()
{
    int N,L,H;
    cin >> N >> L >> H;

    string temp_id;
    int tempScoreDe;
    int tempScoreCai;
    vector<student> stu[5];
    student *pStudent = new student[N];
    for(int i=0; i<N; i++)
    {
        cin >> temp_id;
        cin >> tempScoreDe;
        cin >> tempScoreCai;
        pStudent[i].scoreCai = tempScoreCai;
        pStudent[i].scoreDe = tempScoreDe;
        pStudent[i].id = temp_id;
        stu[ChooseClass(pStudent[i], H, L)-1].push_back(pStudent[i]);
    }
    cout << stu[0].size() + stu[1].size() + stu[2].size() + stu[3].size() << endl;
    for(int i=0; i<4; i++){
        sort(stu[i].begin(),stu[i].end(),cmp);
        for(int j=0; j<stu[i].size(); j++)
        {
            cout << stu[i][j].id << " " << stu[i][j].scoreDe << " " << stu[i][j].scoreCai << endl;
        }
    }

}

发表于 2018-07-05 14:13:11 回复(0)
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
struct node{
    int id;
    int l;
    int h;
    int zong;
    void f(int id1,int l1,int h1)
    {
        id=id1;
        l=l1;
        h=h1;
        zong=l+h;
    }
}e;
vector<node> a,b,c,d;
bool cmp(const node &a,const node &b)
{
    if(a.zong>=b.zong)
    {
        if(a.zong==b.zong)
        {
            if(a.l>=b.l)
            {
                if(a.l==b.l)
                {
                    if(a.id>b.id)
                        return false;
                    else
                        return true;
                }
                return true;
            }
            else
                return false;
        }
        return true;
    }
    else
        return false;
}
void prin(vector<node> m)
{
    vector<node>::iterator it=m.begin();
    for(;it!=m.end();it++)
        printf("%d %d %d\n",it->id,it->l,it->h);
}
int main()
{
    int N,L,H,i,id,l,h,sum=0;
    scanf("%d%d%d",&N,&L,&H);
    for(i=0;i<N;i++)
    {
        scanf("%d%d%d",&id,&l,&h);
        if(l>=L&&h>=L)
        {
            sum++;
            e.f(id,l,h);
            if(l>=H&&h>=H)
                a.push_back(e);
            else if(l>=H)
                b.push_back(e);
            else if(l>=h)
                c.push_back(e);
            else
                d.push_back(e);
        }
    }
    sort(a.begin(),a.end(),cmp);
    sort(b.begin(),b.end(),cmp);
    sort(c.begin(),c.end(),cmp);
    sort(d.begin(),d.end(),cmp);
    printf("%d\n",sum);
    prin(a);
    prin(b);
    prin(c);
    prin(d);
    return 0;
发表于 2018-04-18 10:40:17 回复(0)
关键在于学生排序的算法compareTo()

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.TreeSet;
public class Main {
    private static class Student implements Comparable<Student>{
        publicStudent(intid, intmorality, intability) {
            // TODO Auto-generated constructor stub
            this.id = id;
            this.morality = morality;
            this.ability = ability;
        }
        int id = 0;
        int morality = 0;
        int ability = 0;
 
        @Override
        public int compareTo(Student o) {
            // TODO Auto-generated method stub
             
            intresult = 0;
 
            if(o instanceof Student) {
                Student student = (Student)o;
                 
                if((this.ability + this.morality) >
                    (student.ability + student.morality)) {
                    result = -1;
                }elseif((this.ability + this.morality) ==
                (student.ability + student.morality)) {
                    if(this.morality > student.morality) {
                        result = -1;
                    }elseif(this.morality == student.morality) {
                        if(this.id < student.id) {
                            result = -1;
                        }elseif(this.id == student.id) {
                            result = 0;
                        }else{
                            result = 1;
                        }
                    }else{
                        result = 1;
                    }
                }else{
                    result = 1;
                }
            }
            return result;
        }
         
        public void print Student() {
            System.out.println(this.id + " "+
                    this.morality + " "+ this.ability);
        }
    }
 
     
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
         
        String line = bufferedReader.readLine();
        String[] params = line.split(" ");
         
        intN = 0;
        intL = 0;
        intH = 0;
         
        N = Integer.parseInt(params[0]);
        L = Integer.parseInt(params[1]);
        H = Integer.parseInt(params[2]);
         
        Student[] students = newStudent[N];
         
        for(int i = 0; i < N; i++) {
            line = bufferedReader.readLine();
            params = line.split(" ");
            students[i] = newStudent(Integer.parseInt(params[0]), Integer.parseInt(params[1]),Integer.parseInt(params[2]));
        }
         
        TreeSet[] studentClass = new TreeSet[4];
         
        studentClass[0] = new TreeSet<Student>();
        studentClass[1] = new TreeSet<Student>();
        studentClass[2] = new TreeSet<Student>();
        studentClass[3] = new TreeSet<Student>();
         
        int passStudentCount = 0;
         
        for(int i = 0; i < students.length; i++) {
            if(students[i].ability >= H && students[i].morality >= H) {
                studentClass[0].add(students[i]);
                passStudentCount++;
            }elseif(students[i].ability >= L && students[i].ability < H &&
                    students[i].morality >= H) {
                studentClass[1].add(students[i]);
                passStudentCount++;
            }elseif(students[i].ability >= L && students[i].ability < H &&
                    students[i].morality >= L && students[i].morality < H &&
                    students[i].morality >= students[i].ability) {
                studentClass[2].add(students[i]);
                passStudentCount++;
            }elseif(students[i].ability >= L && students[i].morality >= L) {
                studentClass[3].add(students[i]);
                passStudentCount++;
            }
        }
         
        System.out.println(passStudentCount);
         
        Iterator<Student> treeSetIterator = null;
         
        for(int i = 0; i < studentClass.length; i++) {
            treeSetIterator = studentClass[i].iterator();
            while(treeSetIterator.hasNext()) {
                Student tempStudent = treeSetIterator.next();
                tempStudent.printStudent();
            }
        }
    }
}

编辑于 2017-11-15 11:58:46 回复(0)
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N  = in.nextInt();
        int L = in.nextInt();
        int H = in.nextInt();
        TreeSet<Student> students = new TreeSet<Student>();
        for (int i = 0; i < N; i ++) {
            Student student = new Student(in.nextInt(), in.nextInt(), in.nextInt(), H);
            if (student.de >= L && student.cai >= L)
                students.add(student);
        }
        System.out.println(students.size());
        for (Student student : students)
            System.out.println(student.id + " " + student.de + " " + student.cai);


    }
    static class Student implements Comparable<Student>{
        int id, de, cai, level;
        Student(int id, int de, int cai, int H) {
            this.id = id;
            this.de = de;
            this.cai = cai;
            if (this.de >= H && this.cai >= H)
                level = 4;
            else if (this.de >= H)
                level = 3;
            else if (this.de >= this.cai)
                level = 2;
            else
                level = 1;
        }

        @Override
        public int compareTo(Student o) {
            int sum1 = this.de + this.cai;
            int sum2 = o.de + o.cai;
            if (this.level > o.level)
                return -1;
            else if(this.level == o.level) {
                if (sum1 > sum2)
                    return -1;
                else if(sum1 == sum2) {
                    if (this.de > o.de)
                        return -1;
                    else if (this.de == o.de && this.id < o.id)
                        return -1;
                }
            }
            return 1;
        }
    }
}

为什么总是提示内存超限,感觉没什么问题,求解答?

发表于 2017-07-06 00:17:31 回复(1)
importjava.util.ArrayList;
importjava.util.Scanner;
 
publicclassMain {
    publicstaticvoidmain(String[] args) {
        Scanner in = newScanner(System.in);
        while(in.hasNext()){
            intn=in.nextInt(),L=in.nextInt(),H=in.nextInt();
            int[] ids=newint[n];
            int[] des=newint[n];
            int[] cais=newint[n];
            int[] totals=newint[n];
            ArrayList<Integer> list1=newArrayList<Integer>();
            ArrayList<Integer> list2=newArrayList<Integer>();
            ArrayList<Integer> list3=newArrayList<Integer>();
            ArrayList<Integer> list4=newArrayList<Integer>();
            intM=0;
            for(inti = 0; i < n; i++) {
                ids[i]=in.nextInt();
                des[i]=in.nextInt();
                cais[i]=in.nextInt();
                totals[i]=des[i]+cais[i];
                 
                if(des[i]>=L && cais[i]>=L){
                    M++;
                    if(des[i]>=H && cais[i]>=H){//1
                        list1.add(i);
                    }
                    elseif(cais[i]<=H && des[i]>=H){//2
                        list2.add(i);
                    }
                    elseif(cais[i]<=H && des[i]<=H && des[i]>=cais[i]){//3
                        list3.add(i);
                    }
                    else{//4
                        list4.add(i);
                    }
                }
            }
            System.out.println(M);
             
            intlen1=list1.size(),len2=list2.size(),len3=list3.size(),len4=list4.size();
            Integer[] index=newInteger[]{};
             
            index=list1.toArray(index);
            fun(len1,index,totals,ids,cais,des);
            for(inti = 0; i < len1; i++) {
                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);
            }
             
            index=list2.toArray(index);
            fun(len2,index,totals,ids,cais,des);
            for(inti = 0; i < len2; i++) {
                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);
            }
             
            index=list3.toArray(index);
            fun(len3,index,totals,ids,cais,des);
            for(inti = 0; i < len3; i++) {
                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);
            }
             
            index=list4.toArray(index);
            fun(len4,index,totals,ids,cais,des);
            for(inti = 0; i < len4; i++) {
                System.out.printf("%d %d %d\n",ids[index[i]],des[index[i]],cais[index[i]]);
            }
        }
    }
     
    privatestaticvoidfun(intlen,Integer[] index,int[] totals,int[] ids,int[] cais,int[] des){
        int[] tempTotals=newint[len];
        int[] tempIds=newint[len];
        int[] tempDes=newint[len];
        int[] tempCais=newint[len];
        for(inti = 0; i < len; i++) {
            tempTotals[i]=totals[index[i]];
            tempIds[i]=ids[index[i]];
            tempDes[i]=des[index[i]];
            tempCais[i]=cais[index[i]];
        }
         
        inttemp=0;
        for(inti = len-1; i > 0; i--) {
            for(intj = 0; j < i; j++) {
                booleanflag=false;
                if(tempTotals[j]<tempTotals[j+1]){
                    flag=true;
                }
                elseif(tempTotals[j]==tempTotals[j+1]){
                    if(tempDes[j]<tempDes[j+1]){
                        flag=true;
                    }
                    elseif(tempDes[j]==tempDes[j+1]){
                        if(tempIds[j]>tempIds[j+1]){
                            flag=true;
                        }
                    }
                }
                 
                if(flag){                  
                    temp=index[j];
                    index[j]=index[j+1];
                    index[j+1]=temp;
                     
                    temp=tempTotals[j];
                    tempTotals[j]=tempTotals[j+1];
                    tempTotals[j+1]=temp;
                     
                    temp=tempIds[j];
                    tempIds[j]=tempIds[j+1];
                    tempIds[j+1]=temp;
                     
                    temp=tempDes[j];
                    tempDes[j]=tempDes[j+1];
                    tempDes[j+1]=temp;
                     
                    temp=tempCais[j];
                    tempCais[j]=tempCais[j+1];
                    tempCais[j+1]=temp;
                }
            }
        }
    }
}
内存超限,不明白,为什么会超啊,数据也不是很大啊。
发表于 2017-06-20 10:28:38 回复(1)
//难度倒是还好,处处是坑还没办法手动测试啊哭……
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
using std::vector;
  
struct S{
    string num;
    int de;
    int cai;
    int total;
};
typedef S stu;
 
bool cmp(stu a, stu b){
    if(a.total != b.total)
            return a.total > b.total;
    else if(a.de != b.de)
            return a.de > b.de;
    else    return a.num < b.num;
}
int main(){
    int N, L, H, cnt = 0;
    vector<stu> lev[4];
    stu t;
    cin >> N >> L >> H;
    for(int i = 0; i < N; i++){
        cin >> t.num >> t.de >> t.cai;
        t.total = t.de + t.cai;
        if(t.de >= H && t.cai >= H)             lev[0].push_back(t);
        else if(t.de >= H && t.cai >= L)      lev[1].push_back(t);
        else if(t.de >= t.cai && t.cai >= L)  lev[2].push_back(t);
        else if(t.de >= L && t.cai >= L)      lev[3].push_back(t);
        else;
        if(t.de >= L && t.cai >= L)       cnt++;
    }
    for(int i = 0; i < 4; i++)
        sort(lev[i].begin(), lev[i].end(), cmp);
    cout << cnt << endl;
    for(int i = 0; i < 4; i++)
        for(int j = 0; j < lev[i].size(); j++)
            cout << lev[i][j].num << " " << lev[i][j].de << " " << lev[i][j].cai << endl;           
    return 0;
}

发表于 2017-04-10 11:13:21 回复(0)
//冒泡排序,性能不佳
#include<stdio.h>
#include<stdlib.h>
typedef struct{
	long id0;
	int score1;
	int score2;
} Student;
void BubbleSort(Student list[], int n){
	int i,j,s1,s2,temp;
	long temp2;
	if(n>1){
	  for(i=0;i<n-1;i++)
	    for(j=0;j<n-i-1;j++){
	    	s1=list[j].score1+list[j].score2;
	    	s2=list[j+1].score1+list[j+1].score2;
    		if(s1<s2 || s1==s2&&list[j].score1<list[j+1].score1 || s1==s2&&list[j].score1==list[j+1].score1 && list[j].id0>list[j+1].id0){
    			temp2=list[j].id0; list[j].id0=list[j+1].id0; list[j+1].id0=temp2;
    			temp=list[j].score1; list[j].score1=list[j+1].score1; list[j+1].score1=temp;
		    	temp=list[j].score2; list[j].score2=list[j+1].score2; list[j+1].score2=temp;}
    	}
	}
}
void printList(Student list[], int n){
	 int i;
	 for(i=0;i<n;i++)
	     printf("%ld %d %d\n",list[i].id0,list[i].score1,list[i].score2);
} 
int main(){
	Student *List;
	Student *list1,*list2,*list3,*list4;
	int n,L,H;
	int i,i1,i2,i3,i4,Count1,Count2,Count3,Count4;
	int *Label;
	scanf("%d %d %d",&n,&L,&H);
	List=(Student *)malloc(n*sizeof(Student));
	Label=(int *)malloc(n*sizeof(int));
	Count1=Count2=Count3=Count4=0;
	for(i=0;i<n;i++){
		scanf("%ld %d %d",&List[i].id0,&List[i].score1,&List[i].score2);
		if(List[i].score1<L || List[i].score2<L){
		   Label[i]=-1;
		}else{
		  if(List[i].score1>=H && List[i].score2>=H){
		     Label[i]=1;Count1++;}
          else if(List[i].score1>=H && List[i].score2<H){
          	       Label[i]=2;Count2++;}
          else if(List[i].score1<H && List[i].score2<H && List[i].score1>=List[i].score2){
          	       Label[i]=3;Count3++;}
          else{Label[i]=4;Count4++;}
		}
	}

	list1=(Student *)malloc(Count1*sizeof(Student));
	list2=(Student *)malloc(Count2*sizeof(Student));
	list3=(Student *)malloc(Count3*sizeof(Student));
	list4=(Student *)malloc(Count4*sizeof(Student));
	i1=i2=i3=i4=0;
	for(i=0;i<n;i++){
		if(Label[i]==1){
		   list1[i1].id0=List[i].id0;
		   list1[i1].score1=List[i].score1;
		   list1[i1++].score2=List[i].score2;}
        else if(Label[i]==2){
        	list2[i2].id0=List[i].id0;
		    list2[i2].score1=List[i].score1;
		    list2[i2++].score2=List[i].score2;
           }
        else if(Label[i]==3){
        	list3[i3].id0=List[i].id0;
		    list3[i3].score1=List[i].score1;
		    list3[i3++].score2=List[i].score2;
           }
         else if(Label[i]==4){
        	list4[i4].id0=List[i].id0;
		    list4[i4].score1=List[i].score1;
		    list4[i4++].score2=List[i].score2;
           }
	}

	if(Count1 > 0){
	  BubbleSort(list1,Count1);
	  printList(list1,Count1);}
    if(Count2 > 0){
	  BubbleSort(list2,Count2);
	  printList(list2,Count2);}
    if(Count3 > 0){
	  BubbleSort(list3,Count3);
	  printList(list3,Count3);}
    if(Count4 > 0){
	  BubbleSort(list4,Count4);
	  printList(list4,Count4);}

}

发表于 2016-09-04 09:58:57 回复(0)
//思路很简单,但是相当慢,提交的时候排在了180多名(相当于1/2之后)
#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
using namespace std;
int num,low,first;  //low及格线 first优先线 

struct S{ //结构体存输入信息 
int no;
int de;
int cai;
};

bool cmp( S x, S y){  //自定义比较函数 
        
if(x.de+x.cai!=y.de+y.cai)
   return (x.de+x.cai)>(y.de+y.cai);
 else 
    if(x.de!=y.de)
      return x.de>y.de;
 else 
    return x.no<y.no;
}

int main(){
S stu;
vector<S> v1,v2,v3,v4;//v1德才双尽,v2德胜才,v3才德不及,仍德胜才,v4及格线守门员 
int count=0;
cin>>num>>low>>first; 
for(int i=0;i<num;i++)
  cin>>stu.no>>stu.de>>stu.cai;
 
 if(stu.de>=low&&stu.cai>=low){ //边输入 边分类 
     count++; 
  if(stu.de>=first&&stu.cai>=first) //德才双尽 
        v1.push_back(stu);
  else  if(stu.de>=first)         //德胜才 
        v2.push_back(stu);
  else  if(stu.de>=stu.cai)       //才德兼亡 德胜才 
        v3.push_back(stu);
  else 
        v4.push_back(stu);      //及格线守门员 
  }
}

sort(v1.begin(),v1.end(),cmp); //sort函数排序 
sort(v2.begin(),v2.end(),cmp);
sort(v3.begin(),v3.end(),cmp);
sort(v4.begin(),v4.end(),cmp);

cout<<count<<endl;      //及格人数 

for(int i=0;i<v1.size();i++)   //第一类在前,依次输出 
cout<<v1[i].no<<" "<<v1[i].de<<" "<<v1[i].cai<<endl;
for(int i=0;i<v2.size();i++)
cout<<v2[i].no<<" "<<v2[i].de<<" "<<v2[i].cai<<endl;
for(int i=0;i<v3.size();i++)
cout<<v3[i].no<<" "<<v3[i].de<<" "<<v3[i].cai<<endl;
for(int i=0;i<v4.size();i++)
cout<<v4[i].no<<" "<<v4[i].de<<" "<<v4[i].cai<<endl;

return 0;
发表于 2016-02-23 21:38:45 回复(0)
//分组然后执行插入排序,然后依次输出
#include <iostream>
#include <list>
#include <string>
using namespace std;
struct Candidate {
    long long number;
    int moral;
    int talent;
};
void insert(list<Candidate> & cands, Candidate temp) {
    for (auto b = cands.begin();b != cands.end();++b) {
        if (temp.moral + temp.talent > b->moral + b->talent) {
            cands.insert(b, temp);
            return;
        }
        if (temp.moral + temp.talent == b->moral + b->talent) {
            if (temp.moral > b->moral) {
                cands.insert(b, temp);
                return;
            }
            else if (temp.moral == b->moral) {
                if (temp.number < temp.number) {
                    cands.insert(b, temp);
                    return;
                }
                else {
                    continue;
                }
            }
            else {
                continue;
            }
        }
    }
    cands.insert(cands.end(), temp);
}
int main() {
    int N, L, H;
    cin >> N >> L >> H;
    list<Candidate> first, second, third, fourth;
    while (N--) {
        long long number;
        int moral, talent;
        cin >> number >> moral >> talent;
        if (moral >= L&&talent >= L) {
            Candidate temp{ number,moral,talent };
            if (moral >= H&&talent >= H) {
                insert(first, temp);
                continue;
            }
            if (moral >= H&&talent >= L) {
                insert(second, temp);
                continue;
            }
            if (moral >= talent) {
                insert(third, temp);
                continue;
            }
            insert(fourth, temp);
        }
    }
    cout << first.size() + second.size() + third.size() + fourth.size() << endl;
    for (auto b = first.begin();b != first.end();++b) {
        cout << b->number << " " << b->moral << " " << b->talent << endl;
    }
    for (auto b = second.begin();b != second.end();++b) {
        cout << b->number << " " << b->moral << " " << b->talent << endl;
    }
    for (auto b = third.begin();b != third.end();++b) {
        cout << b->number << " " << b->moral << " " << b->talent << endl;
    }
    for (auto b = fourth.begin();b != fourth.end();++b) {
        cout << b->number << " " << b->moral << " " << b->talent << endl;
    }
}

发表于 2015-10-06 16:00:48 回复(0)



lst = list(map(int,input().split()))
num, l, h = lst[0],lst[1],lst[2]
alst,l1,l2,l3,l4,l5 = [],[],[],[],[],[] for j in range(num):
    alst.append(list(map(int,input().split()))) for i in range(num):  if alst[i][1] >= h and alst[i][2] >= h:
        l1.append(alst[i])  elif alst[i][1] >= h and alst[i][2] < h and alst[i][2] >= l:
        l2.append(alst[i])  elif alst[i][1] < h and alst[i][2] < h and alst[i][1] >= alst[i][2] and alst[i][1] >= l and alst[i][2] >= l:
        l3.append(alst[i])  elif alst[i][1] >= l and alst[i][2] >= l and alst[i][1] < h:
        l4.append(alst[i]) else:l5.append(alst[i])
l1.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l2.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l3.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l4.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
l5.sort(key=lambda x:((-x[1]-x[2],-x[1],x[0])))
li = l1+l2+l3+l4+l5 print(num-len(l5),end='\n') for t in range(num-len(l5)):  print("%d %d %d"%(li[t][0],li[t][1],li[t][2]),end='\n')



编辑于 2018-08-29 19:15:27 回复(0)
啥头像
总体思路:
先分类再排序,可借助STL中的set组件统一进行
  1. 建立结构体。    除了考号、德分、才分,再添加总分sum、等级level,方便排序
  2. 自定义结构体的排序函数。      先按等级排,再按总分、德分、考号排
  3. 分类。      对读入的考生分类,设定其level值,并插入set中
  4. 输出。       set可根据自定义的排序函数自动排序,直接反序输出即可
代码如下:
#include <iostream>
#include <set>

using namespace std;

class Student
{
public:
    int id, morality, ability, sum, level;
    Student(int id, int morality, int ability) {
        this->id = id;
        this->morality = morality;
        this->ability = ability;
        this->sum = morality + ability;
        level = 4;//默认为第4等级,可改
    }
    bool operator <(const Student& another)const {
        if(level != another.level) {
            return level>another.level;
        } else if(sum != another.sum) {
            return another.sum>sum;
        } else if(morality != another.morality) {
            return another.morality>morality;
        } else {
            return id>another.id;
        }
    }
};

int main()
{
    // 基本变量
    int N, L, H;
    cin >> N >> L >> H;
    set<Student> student;

    // 分类划级
    for(int i=0; i<N; i++) {
        int id, morality, ability;
        cin >> id >> morality >> ability;
        Student stu(id, morality, ability);
        if(stu.morality<L || stu.ability<L) {
            continue;
        } else if(stu.morality >= H && stu.ability >= H) {
            stu.level = 1;
        } else if(stu.morality >= H) {
            stu.level = 2;
        } else if(morality>=ability) {
            stu.level = 3;
        } else {
            stu.level = 4;
        }
        student.insert(stu);
    }

    // 输出结果
    set<Student>::reverse_iterator iter;
    cout << student.size() << endl;
    for(iter=student.rbegin(); iter != student.rend(); iter++) {
        cout << (*iter).id << " " << (*iter).morality << " " << (*iter).ability << endl;
    }
    return 0;
} 


发表于 2015-10-14 14:48:52 回复(11)