fork download
copy 
  1. #include <iostream>
  2. #include <queue>
  3. #include <unordered_map>
  4. #include <algorithm>
  5.  
  6. void init_container(std::unordered_map<std::size_t, std::size_t> *container, const std::size_t n){
  7. 	std::size_t weight;
  8. 	for(std::size_t i = 0; i < n; i++){
  9. 		std::cin >> weight;
  10. 		container->insert(std::make_pair(i, weight));
  11. 	}
  12. }
  13.  
  14. void init_warehouse(std::priority_queue<std::size_t> *wh, const std::size_t m){
  15. 	std::size_t weight;
  16. 	for(std::size_t i = 0; i < m; i++){
  17. 		std::cin >> weight;
  18. 		wh->push(weight);
  19. 	}
  20. }
  21.  
  22. void update_container(std::unordered_map<std::size_t, std::size_t> *container, std::priority_queue<std::size_t> warehouse){
  23. 	if(!warehouse.empty()){
  24. 		int piece_weight = warehouse.top();
  25. 		warehouse.pop();
  26. 	}
  27. }
  28.  
  29. int main(){
  30. 	std::size_t n, m, a, b, k;
  31. 	std::priority_queue<std::size_t> warehouse;
  32. 	std::unordered_map<std::size_t, std::size_t> container;
  33.  
  34. 	std::cin >> n;	//N кусков в контейнере
  35. 	std::cin >> m;	//M кусков в хранилище
  36. 	std::cin >> a;
  37. 	std::cin >> b;
  38. 	std::cin >> k;	//K кусков, выданных покупателю
  39.  
  40. 	//Загружаем куски в соответствующие хранилища
  41. 	init_container(&container, n);
  42. 	init_warehouse(&warehouse, m);
  43. }
Success #stdin #stdout 0s 3416KB
comments (?)
stdin
copy 
3 2 1 1 2
5 1 3
4 2
stdout
copy 
Standard output is empty
https://ideone.com/WGiaQU
language:
C++14 (gcc 8.3)
created:
9 years 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!