关于栈，优先队列

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<deque>
#include<list>
#include<stack>
using namespace std;
int main()
{
   stack<int> s;
   s.push(1);
   s.push(2);
   s.push(3);
   s.push(9);
   cout<<s.top()<<endl;
   cout<<s.size()<<endl;
   cout<<s.empty()<<endl;
   while(!s.empty())
   {
       cout<<s.top()<<" ";
       s.pop();
   }
   cout<<endl;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<deque>
#include<list>
#include<stack>
#include<queue>
using namespace std;
struct Info
{
    string name;
    float score;
    bool operator < (const Info &a) const
    {
        return a.score<score;
    }
};
int main()
{
  priority_queue<Info> pq;
  Info info;
  info.name="Jack";
  info.score=68.5;
  pq.push(info);
  info.name="Bomi";
  info.score=18.5;
  pq.push(info);
  info.name="Peti";
  info.score=90;
  pq.push(info);
  while(!pq.empty())
  {
      cout<<pq.top().name<<" : "<<pq.top().score<<endl;
      pq.pop();
  }
  return 0;
}