Establishment of zstuacm student information base (completed with linked list)

Preliminarily master the establishment of linked list , Now let's do another simple linked list operation .
Enter some student information , Including student ID 、 full name 、 achievement .
Now you are required to create a linked list of student libraries with functions .
struct node
{
…
};
struct node * Create_Stu_Doc();
Complete the creation of linked list in the function .
Input
Enter some student information , One line of information for each student , Student number 、 Name and score , Space separates the middle , Both student number and grade are integers , Name is no more than 15 Characters that contain only uppercase and lowercase letters .
If the input line is a non positive integer , End of the said
Output
Create a linked list according to the input order , And output all student numbers and scores higher than the average score , Each row 2 It's an integer , Space separates the middle .
The sample input Copy
1001 xiangwang 90
1002 xiaoli 85
1003 xiaohong 97
1004 xiaoma 76
-1
Sample output Copy
1001 90
1003 97

In fact, there is template code under the original question , But I think STL It is a very convenient and practical tool , So I want to try STL Go and finish the problem

The beginning and other templates are nothing , Until later find_if（begin（）,end（）,function） function .
The first two parameters are not difficult , The hard one is the last one , Use classes and objects , Even though acm In the game , Classes and objects are used only a few times , It may not even be used , however , As c++ Users of , In the future, classes and objects are the top priority in work , So I decided to write here once .

#include <iostream>
#include<cstdio>
#include<string>
#include<list>
#include<vector>
using namespace std;

// The best way to define a structure is , standard ！！！！
typedef struct tag_students
{
    
	int no;
	string name;
	int grade;
}students;

class CFinderGeaterNum
{
    
public:
	CFinderGeaterNum(int nNum)
	{
    
		m_nNum = nNum;
	}
	bool operator()(const std::list<students>::value_type &value)
	{
    
		if (value.grade > m_nNum)
		{
    
			return true;
		}
		return false;
	}

private:
	int m_nNum;
};



int main()
{
    

	list<students>stu1;
	students stu2;
	int ave = 0;
	while (1)
	{
    
		int no1 = 0;// The student ID entered 
		string name1;// Enter your name 
		int grade1 = 0;// The grade entered 

		cin >> no1;
		if (no1 <= 0)// If the student number entered <=0, Then push the loop 
		{
    
			break;
		}
		cin >> name1 >> grade1;

		stu2.no = no1;
		stu2.grade = grade1;
		stu2.name = name1;

		ave = ave + stu2.grade;// averaging , The total number will be divided later 

		stu1.push_back(stu2);
	}

	ave = ave / stu1.size() * 1.0;
	
	int xxxxxx = 5;
	
	list<students>::iterator val_begin = stu1.begin();
	
	

	
	while (true)
	{
    
		
		list<students>::iterator it = find_if(val_begin, stu1.end(),
			CFinderGeaterNum(ave));
		if (it != stu1.end())
		{
    
			// Find one 
			cout << it->no <<" " << it->grade << endl;

			// Keep looking 
			it++;
			val_begin = it;
			
			continue;

		}
		else
		{
    
			// period 
			break;
		}


	}


	return 0;
}

//！ Pay attention to a big problem , I don't know why acm Use in stl It's easy to exceed the time limit （ Generally speaking stl It's not slow ）, So then , The solution is also simple , hold cin And cout Change it into scanf and printf, These two are faster than cin And cout Many times faster ！