fork download
  1. #include <iostream>
  2. #include <queue>
  3. #include <utility>
  4.  
  5. using namespace std;
  6.  
  7. int main() {
  8. int pointX = 368;
  9. int pointY = 125;
  10. queue<pair<int, int>> kolejka;
  11. kolejka.push(make_pair(pointX, pointY));
  12.  
  13. while (kolejka.size() != 0)
  14. {
  15. pair<int, int> p;
  16. p = kolejka.front();
  17. kolejka.pop();
  18.  
  19. cout << p.first << ' ' << p.second << endl;
  20. }
  21. }
Success #stdin #stdout 0s 3472KB
stdin
Standard input is empty
stdout
368 125