cowcowcowcow

[是泡泡]

奶牛和红牌

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> PII;
#define x first
#define y second
#define ms(a,s) memset(a, s, sizeof a);
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
const int mod = 1e6+7;
const int inf = 0x3f3f3f3f;
const int N = 1e6 + 10;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int a[N];
void solve() {
	int n, d;
	cin >> n >> d;
	for(int i = 1; i <= n; i ++ ) {
		cin >> a[i];
	}
	int num = 0;
	sort(a + 1, a + 1 + n);
	int x = 2;
	for(int i = 1; i <= n; i ++ ) {
		while(x <= n && a[x] - a[i] <= d) x ++;
		x --;
		num += x - i;
	}
	cout << num;
}
int main()
{
	int t = 1;

//	cin >> t;

	while(t --) {
		solve();
	}

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> PII;
#define x first
#define y second
#define ms(a,s) memset(a, s, sizeof a);
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
const int mod = 1e6+7;
const int inf = 0x3f3f3f3f;
const int N = 2010;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int a[N][N];
int f[N][N]; 
void solve() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= m; i ++ ) {
		for(int j = 1; j <= n; j ++ ) {
			cin >> a[j][i];
		}
	}
	
	for(int i = 1; i <= n; i ++ ) {
		for(int j = 1; j <= m; j ++ ) {
			if(j == 1) {
				f[i][j] = min(f[i - 1][j], f[i - 1][m]) + a[i][j];
			} else {
				f[i][j] = min(f[i - 1][j], f[i - 1][j - 1]) + a[i][j];
			}
		}
	}
	
	int num = 10000086;
	for(int i = 1; i <= m; i ++ ) {
		num = min(num, f[n][i]);
	} 	
	cout << num;
}
int main()
{
	int t = 1;

//	cin >> t;

	while(t --) {
		solve();
	}

	return 0;
}