uva 230 Borrowers 习题5-8 (STL string,map练习)

题目：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=166

参考博客：http://blog.csdn.net/wcr1996/article/details/40898767  感谢wcr1996的分享，刚开始连题意都没搞清，模仿着写的，感谢！

说明：练习了find()方法,substr()的用法，map的用法，收货颇多的。

#include<stdio.h>
#include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

struct book{
string author;
int status;
}y;

map<string,book> books;
vector<string>bname;

bool cmp(string a,string b){
if(books[a].author!=books[b].author) return books[a].author<books[b].author;
return a<b;
}

int main(){
string x,z,m;
while(getline(cin,m)){
if(m=="END") break;

int pst=m.find('"');
int pend=m.find_last_of("\"");
x=m.substr(pst,pend+1);//x字符串为书名(包括"") 例如"The Canterbury Tales"
bname.push_back(x);

pst=m.find("by")+3;
y.author=m.substr(pst);
y.status=1;

books[x]=y;
}
sort(bname.begin(),bname.end(),cmp);
/*for(int i=0;i<bname.size();i++)
cout<<bname[i]<<endl;*/
while(cin >>m){
if(m=="END") break;
if(m=="BORROW"){
getchar();
getline(cin,x);
books[x].status=0;
}else if(m=="RETURN"){
getchar();
getline(cin,x);
books[x].status=-1;
}else if(m=="SHELVE"){
for(int i=0;i<bname.size();i++)
if(books[bname[i]].status==-1){
int j;
for(j=i-1;j>=0;j--)
if(books[bname[j]].status==1) break;

if(j==-1)//书架没有书,不包括归还的书
cout << "Put "<<bname[i]<<" first"<<endl;
else
cout << "Put "<<bname[i] <<" after "<<bname[j]<<endl;

books[bname[i]].status=1;
}

cout <<"END"<<endl;
}
}
return 0;
}