CCPC-Wannafly Winter Camp 2018 Day4

//Time: 53ms Memory: 3MB
#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	long long a, b, c, d, e, f, g, h, n, m, sum = 0;
	cin >> n >> m >> e >> f >> g >> h;
	for(int i = 1; i < n; ++i)
	{
		cin >> a >> b >> c >> d;
		long long d1 = abs(a - e) + abs(b - f) + abs(c - g) + abs(d - h);
		long long d2 = abs(a - g) + abs(b - h) + abs(c - e) + abs(d - f);
		e = a, f = b, g = c, h = d;
		sum += min(d1, d2);
	}
	cout << sum + (abs(e - g) + abs(f - h));
}

//Time: 1ms Memory: 3MB
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 100005;
int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n, m;
	int sx, sy, ex, ey;
	cin>> n >> m;
	cin>> sx >> sy >> ex >> ey;
	if(n == 3 && m == 3 && ex == 2 && ey == 2)
    {
			cout << "No" << endl;
			return 0;
	}
	if(n == 2 && m == 2)
    {
		cout << "No" << endl;
		return 0;
	}
	if(m == 2)
    {
		if(sy == ey) cout << "No" << endl;
		else
        {
			if(abs(sx - ex) % 4 == 2) cout << "Yes" << endl;
			else cout << "No" << endl;
		}
		return 0;
	}
	if(n == 2)
    {
		if(sx == ex) cout << "No" << endl;
		else
        {
			if(abs(sy - ey) % 4 == 2) cout << "Yes" << endl;
			else cout << "No" << endl;
		}
		return 0;
	}
	int d = abs(sx - ex) + abs(sy - ey);
	if(d % 2 == 0) cout << "No" << endl;
	else cout << "Yes" << endl;
}

//div2AC代码
//Time: 6ms Memory: 3MB
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1005;
struct node
{
	int a,b;
}s[N];
int v[N] = {0};
int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> s[i].a >> s[i].b;
	ll ans = 0;
	for(int i = 1; i <= n; i++) ans += (ll)s[i].a;
	int pre = 0;
	for(int i = 1; i <= n; i++)
	{
		int maxx = -1e8, p;
		for(int j = 1; j <= n; j++)
		{
			if(v[j]) continue;
			int h = s[j].b * (n - i) - s[j].a - pre;
			if(h > maxx)
            {
				maxx = h;
				p = j;
			}
		}
		if(maxx <= 0) continue;
		v[p] = 1;
		ans += maxx;
		pre += s[p].b;
	}
	cout << ans << endl;
}