UVa230 Borrowers (STL)

 Borrowers 

I mean your borrowers of books - those mutilators of collections, spoilers of the symmetry of shelves, and creators of odd volumes.

- (Charles Lamb, Essays of Elia (1823) `The Two Races of Men')

Like Mr. Lamb, librarians have their problems with borrowers too. People don't put books back where they should. Instead, returned books are kept at the main desk until a librarian is free to replace them in the right places on the shelves. Even for librarians, putting the right book in the right place can be very time-consuming. But since many libraries are now computerized, you can write a program to help.

When a borrower takes out or returns a book, the computer keeps a record of the title. Periodically, the librarians will ask your program for a list of books that have been returned so the books can be returned to their correct places on the shelves. Before they are returned to the shelves, the returned books are sorted by author and then title using the ASCII collating sequence. Your program should output the list of returned books in the same order as they should appear on the shelves. For each book, your program should tell the librarian which book (including those previously shelved) is already on the shelf before which the returned book should go.

Input

First, the stock of the library will be listed, one book per line, in no particular order. Initially, they are all on the shelves. No two books have the same title. The format of each line will be:

``title" by author

The end of the stock listing will be marked by a line containing only the word:

END

Following the stock list will be a series of records of books borrowed and returned, and requests from librarians for assistance in restocking the shelves. Each record will appear on a single line, in one of the following formats:

BORROW ``title"

RETURN ``title"

SHELVE

The list will be terminated by a line containing only the word:

END

Output

Each time the SHELVE command appears, your program should output a series of instructions for the librarian, one per line, in the format:

Put ``  " after ``  "

or, for the special case of the book being the first in the collection:

Put ``title" first

After the set of instructions for each SHELVE, output a line containing only the word:

END

Assumptions & Limitations:

1. A title is at most 80 characters long.

2. An author is at most 80 characters long.

3. A title will not contain the double quote (") character.

Sample Input

"The Canterbury Tales" by Chaucer, G.
"Algorithms" by Sedgewick, R.
"The C Programming Language" by Kernighan, B. and Ritchie, D.
END
BORROW "Algorithms"
BORROW "The C Programming Language"
RETURN "Algorithms"
RETURN "The C Programming Language"
SHELVE
END

Sample Output

Put "The C Programming Language" after "The Canterbury Tales"
Put "Algorithms" after "The C Programming Language"
END
这是一个STL的题目，好久没写STL了，就写了一个这个题目，尽量用STL写的。。
注意空格和双引号；

 #include<iostream>
 #include<algorithm>
 #include<string>
 #include<sstream>
 #include<set>
 #include<map>
 using namespace std;
 struct node
 {
     string name,author; //书名和作者
     friend bool operator < (node a,node b)
     {
         if(a.author==b.author)  return a.name<b.name;
         return a.author<b.author;
     }
 };
 set<node> q; //这个是图书馆的书架上面的书
 set<node> p; //这个是图书馆准备被放上书架的书，就是别人刚还的书，还没来得及放上书架
 map<string,string> Mp; //这是一个书名指向作者的映射
 void deal(string s) // 把输入的作者和书名放入结构体
 {
     node e;
     int len=s.size();
     for(int i=;i<len;i++) if(s[i]=='\"') s[i]=' ';
     stringstream ss(s);
     string temp;
     int flag=,flagch=;
     while(ss >> temp)
     {
         if(temp=="by") {flag=;flagch=;continue;}
         if(flagch==)
         {
             if(flag++) e.name+=" ";
             e.name+=temp;
         }
         else
         {
             if(flag++)  e.author+=" ";
             e.author+=temp;
         }
     }
     Mp[e.name]=e.author;
     q.insert(e);
     return;
 }
 string fun(string st) //fun() 函数用于去掉输入的引号
 {
     string rev;
     int len=st.size();
     for(int i=;i<len;i++) if(st[i]=='\"') st[i]=' ';
     int flag=;
     stringstream ss(st);
     string temp;
     while(ss >> temp)
     {
         if(flag++) rev+=" ";
         rev+=temp;
     }
     return rev;
 }
 int main()
 {
     string temp;
     int num=;
     while(getline(cin,temp)) //输入，处理，然后把书放上书架
     {
         if(temp=="END") break;
         deal(temp);
     }
     while(cin >> temp) //执行指令，
     {
         if(temp=="END") break;
         else if(temp=="SHELVE") //把书放上书架
         {
             while(!p.empty())
             {
                 node e=*p.begin();
                 p.erase(e);
                 set<node>::iterator it=q.lower_bound(e);
                 if(it==q.begin())  cout << "Put \"" << e.name << "\" first" << endl;
                 else
                 {
                     it--;
                     cout << "Put \"" << e.name << "\" after \"" << (*it).name << "\"" << endl;
                 }
                 q.insert(e);
             }
             cout << "END" << endl;
         }
         else //可以一起处理
         {
             string book;
             getline(cin,book);
             book=fun(book);
             string author=Mp[book];
             node e;
             e.name=book;
             e.author=author;
             if(temp=="BORROW")   q.erase(e);
             if(temp=="RETURN")   p.insert(e);
         }
     }
     return ;
 }