Cod sursa(job #2031554)
| Utilizator | Data | 3 octombrie 2017 13:50:24 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <queue>
using namespace std;
struct punct {
int x;
int y;
};
class comparare {
public:
int operator() (punct a, punct b) {
if (a.x == b.x)
return a.y >= b.y;
else
return a.x >= b.x;
}
};
priority_queue< punct, vector<punct>, comparare > h;
punct p;
int main () {
for (int i=1;i<=3;i++) {
cin>>p.x>>p.y;
h.push(p);
}
for (int i=1;i<=3;i++) {
p = h.top();
cout<<p.x<<" "<<p.y<<"\n";
h.pop();
}
return 0;
}
