STL.cpp

(1) vector

int n;
vector<int> v;

int main() {
	scanf("%d",&n);
	For(i,1,n) {
		int x;
		scanf("%d",&x);
		v.push_back(x);
	}
	for(vector<int>::iterator it=v.begin(); it!=v.end(); ++it)printf("%d\n",*it);
	return 0;
}

(2) priority_queue
重载“<”来定义优先级
struct Node {
	int num,len;
};
bool operator <(Node x,Node y) {
	return x.len>y.len;//len小的优先
}
priority_queue<Node> q;

重载“()”来定义优先级
struct Cmp {
	bool operator ()(int &x,int &y) {
		return x>y;//小的优先
	}
};
priority_queue<int,vector<int>,Cmp> q;

(3) map

int n,m;
map<int,int> mp;

int main() {
	scanf("%d",&n);
	For(i,1,n) {
		int x,y;
		scanf("%d%d",&x,&y);
		mp[x]=y;
	}
	scanf("%d",&m);
	For(i,1,m) {
		int x;
		scanf("%d",&x);
		map<int,int>::iterator it=mp.find(x);
		if(it!=mp.end())printf("%d:%d\n",(*it).first,(*it).second);
		else printf("Not found\n");
	}
	return 0;
}