-
Notifications
You must be signed in to change notification settings - Fork 6
/
123.cpp
103 lines (90 loc) · 1.96 KB
/
123.cpp
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
92
93
94
95
96
97
98
99
100
101
102
103
//Steven Kester Yuwono - UVa 123
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
#include <sstream>
using namespace std;
string allToLower(string word){
for(int i=0;i<(int)word.length();i++){
word[i] = tolower(word[i]);
}
return word;
}
string allToUpper(string word){
for(int i=0;i<(int)word.length();i++){
word[i] = toupper(word[i]);
}
return word;
}
struct Data{
string keyword;
string word;
int order1;
int order2;
bool operator() (const Data& lhs, const Data& rhs){
if (lhs.keyword != rhs.keyword) {
return lhs.keyword > rhs.keyword;
}
else if (lhs.order1 != rhs.order1) {
return lhs.order1 > rhs.order1;
}
else {
return lhs.order2 > rhs.order2;
}
}
};
set<string> ignoreSet;
set<string>::iterator it;
int main(){
string ignore;
while((getline(cin,ignore))&&(ignore!="::")){
ignoreSet.insert(allToLower(ignore));
}
priority_queue<Data,vector<Data>,Data> pq;
int count1=0;
string sentence;
while(getline(cin,sentence)){
istringstream istream(sentence);
vector<string> sentenceVec;
string word;
while(istream>>word){
sentenceVec.push_back(allToLower(word));
}
for(int i=0;i<(int)sentenceVec.size();i++){
it = ignoreSet.find(sentenceVec[i]);
if(it!=ignoreSet.end()){
continue;
}
//if the word is not in the ignore list
string newWord;
string newKeyword;
for(int j=0;j<(int)sentenceVec.size();j++){
string currWord = sentenceVec[j];
if(j==i){
currWord = allToUpper(sentenceVec[j]);
newKeyword = currWord;
}
if(j==0){
newWord = newWord + currWord;
}
else{
newWord = newWord + " " + currWord;
}
}
Data newData;
newData.keyword = newKeyword;
newData.word = newWord;
newData.order1 = count1;
newData.order2 = i;
pq.push(newData);
}
count1++;
}
while(!pq.empty()){
cout << pq.top().word << endl;
pq.pop();
}
return 0;
}