-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtop.cpp
More file actions
91 lines (72 loc) · 1.23 KB
/
Copy pathtop.cpp
File metadata and controls
91 lines (72 loc) · 1.23 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
template <typename T>
bool Cmp(const T a, const T b)
{
return a < b ? 1 : 0;
};
template<typename key, typename value>
class TopResult
{
private:
map<key, value> Top;
int maxsize;
public:
TopResult(){};
TopResult(int l): maxsize(l){};
void SetMaxSize(int l)
{
maxsize=l;
}
void AddElement(const key& q,const value& h)
{
if(Top.size()<maxsize)
{
Top[q]=h;
}
else
{
value minv=h;
key mink=q;
for(auto it = Top.begin(); it != Top.end(); it++)
{
if (it->second<minv)
{
minv=it->second;
mink=it->first;
}
}
if(Cmp(minv,h))
{
Top.erase(mink);
Top[q]=h;
}
}
}
int GetMaxSize(){return(maxsize);}
void PrintMap()
{
for(auto it = Top.begin(); it != Top.end(); ++it)
cout<<"["<<it->first<<"] = "<<it->second<<'\n';
}
};
int main()
{
TopResult <int, string> mytop(1);
string mystr;
int q;
mystr= new char[20];
for(int i=0;i<3;i++)
{
cin>>q>>mystr;
mytop.AddElement(q,mystr);
}
mytop.PrintMap();
return(0);
}
// g++ top.cpp -std=c++11 -o top