[ create a new paste ] login | about

Link: http://codepad.org/DJ9AKsBY    [ raw code | fork ]

alimbubt - C++, pasted on Mar 17:
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<cctype>
#include<map>
#include<stack>
#include<cstdlib>
#include <queue>
#include <vector>
#include<algorithm>
#include<utility>

using namespace std;
int main()
{
    pair< int,pair<int,int> >pp[100];
    pp[0].first=100;
    pp[1].first=200;
    pp[2].first=300;
    pp[0].second=make_pair(1,2);
    pp[1].second=make_pair(3,4);
    pp[2].second=make_pair(5,6);
    priority_queue<pair<int,pair<int,int> > >pq;
    pq.push(pp[0]);
    pq.push(pp[1]);
    pq.push(pp[2]);
    pair<int,pair<int,int> >m=pq.top();
    printf("%d\n",m.first);
    printf("%d\n%d\n",m.second.first,m.second.second);
    return 0;
}


Create a new paste based on this one


Comments: