fork download
copy 
  1. #include <vector>
  2. #include <cfloat>
  3. #include <cstdio>
  4. #include <cstring>
  5. #include <climits>
  6. #include <ctime>
  7. #include <cstdlib>
  8. #include <cmath>
  9. #include <string>
  10. #include <iostream>
  11. #include <cstdint>
  12. #include <algorithm>
  13. #include <cassert>
  14. #include <random>
  15. #include <queue>
  16. #include <deque>
  17. #include <list>
  18. #include <map>
  19. #include <array>
  20. #include <chrono>
  21. #include <fstream>
  22. #include <functional>
  23. #include <unordered_map>
  24. using namespace std;
  25.  
  26. struct node{
  27. int x;
  28. int y;
  29. double score;
  30. 	bool operator < (const node& n)const {//スコアが高い方が優先される
  31. 		return score < n.score;
  32. 	}
  33. };
  34.  
  35. int main() {
  36. 	// your code goes here
  37.  
  38. 	priority_queue<node>pque;
  39.  
  40. 	node n;
  41. 	n.x=5;
  42. 	n.y=6;
  43. 	n.score=0.5;
  44. 	pque.push(n);
  45. 	n.x=3;
  46. 	n.y=4;
  47. 	n.score=0.6;
  48. 	pque.push(n);
  49. 	n.x=1;
  50. 	n.y=2;
  51. 	n.score=0.7;
  52. 	pque.push(n);
  53.  
  54. 	while(1){
  55.  
  56. 	if(pque.empty()){break;}
  57.  
  58. 	node v=pque.top();pque.pop();
  59.  
  60. 	cout<<v.score<<endl;
  61.  
  62. 	}
  63.  
  64. 	return 0;
  65. }
Success #stdin #stdout 0.01s 5408KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0.7
0.6
0.5
https://ideone.com/FqckhY
language:
C++14 (gcc 8.3)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!