Safflower STL

requirement : The kindergarten organizes students by class , Students in each class are numbered according to their student number , The scale is 25 A child , One is used for school attendance every day bitset describe ,1 Represents attendance ,0 Representative absence , Try to write interface functions ,

Output the serial number and attendance of each child

Find the one with the highest attendance 3 A child gives the little red flower of the month .

data ：

1111111111111111111111111 1110111011101110111011100 1101101101101101101101101 1111011110111101111011110 0011101110111101111101111 0011101111011111110111111 1111101111110111111100111 1100111110001111111111110 1111111111111101111111111 1111011111011111111110111

 

#include<iostream>
#include<vector>
#include<bitset>
#include<algorithm>
#include<fstream>
#include<string>
#include<iterator>
using namespace std;
template<size_t N>
class base
{
public:
	bitset<N> b;
	int id;

};

template<size_t N>
class com
{
public:
	com() {}
	bool operator()(const base<N>& b1, const base<N>&b2)
	{
		return b1.b.count() <= b2.b.count() ? false : true;
	
	}
};


void main()
{
	vector<char>v;
	ifstream out("data.txt");
	copy(istream_iterator<char>(out), istream_iterator<char>(), back_inserter(v));
	vector<base<10>> vb(25);
	cout << endl;
	cout << endl;	cout << endl;
	for (int i=0;i<25;i++)
	{
		for (int j =0;j<10;j++)
		{
			vb[i].b.set(j, (v[j * 25 + i]-48));
		}
		vb[i].id = i;
		cout << vb[i].b.to_string() << endl;
	}
	for (int i=0;i<25;i++)
	{
		cout << vb[i].b.count() << endl;
	}
	sort(vb.begin(),vb.end(),com<10>());
	for (int i = 0; i < 25; i++)
	{
		cout << vb[i].b.to_string() <<"   "<<vb[i].id<< endl;
	}
	cout << " Little Honghua's classmate is " << endl;
	cout << vb[0].id <<"    "<< vb[1].id << "    " << vb[2].id << "   " <<vb[3].id<<endl;

	
	cin.get();
}

test result ：