The front() method of C++ queue queue

The front() method of C++ queue queue

• Code

#include<queue>
#include<iostream>
#include<vector>
#define N 100
using namespace std;
struct Node{
    
    
	int lv;//记录当前层数
	int wei;//当前重量
	int val;//当前价值
	int status[N];//当前存储数组 
};
int main(){
    
    
	queue<Node> q;
	Node p={
    
    0,2,0,{
    
    0}};
	q.push(p);
		
	Node n1 = q.front();
	cout<<n1.wei<<endl;
	cout<<"====================================="<<endl; 
	
	n1.wei=20;
	Node n2 = q.front();
	cout<<n1.wei<<endl;
	cout<<n2.wei<<endl;
	
	return 0;
}

• operation result