keep only the top 3 salespeople : list erase « List « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » List » list eraseScreenshots 
keep only the top 3 salespeople
  
#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>

using namespace std;

class Employee
{
   public:
   Employeeconst string& name = ""int sales = 0,int district = );
   bool operator>const Employee& rhs const;
   void print() const;

   private:
   int district_;
   string name_;
   int sales_;
};

inline
Employee::Employeeconst string& name, int sales,
   int district )
   : district_district ), name_name ), sales_sales )
{} 

inline
bool Employee::operator>const Employee& rhs const
return sales_ > rhs.sales_; }

inline
void Employee::print() const
cout << name_ << " from District " << district_
   << " has sales of $" << sales_ << endl;
}

int main( )
{
   list<Employee> list1;
   list1.push_backEmployee"A"3) );
   list1.push_backEmployee"B"4) );
   list1.push_backEmployee"C"8) );

   list1.sortgreater<Employee>() );
   for_eachlist1.begin(), list1.end(), mem_fun_ref&Employee::print ) );

   const int top_positions = 3;
   list<Employee>::iterator position = list1.begin();
   advanceposition, top_positions );
   list1.eraseposition, list1.end() );

   for_eachlist1.begin(), list1.end(),mem_fun_ref&Employee::print ) );

}
  
    
  
Related examples in the same category
1.Demonstrating the STL list erase function
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.