lambda学习实例

【接受两个int,返回和】

int main() {
	auto sum = [](int a, int b) {return a + b; };
	cout << sum(1, 1);
}

【结构体排序】

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
const int maxn = 1e5+4;

struct node{
	int x,y,z;
}k[maxn];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d%d%d", &k[i].x, &k[i].y, &k[i].z);
	}
	sort(k+1,k+1+n,
		[](const node &a, const node &b) {
		return a.z < b.z; });
	for (int i = 1; i <= n; i++) {
		printf("%d %d %d\n", k[i].x, k[i].y, k[i].z);
	}
}