Why F WA*19?
  • 板块学术版
  • 楼主Vitamin_B
  • 当前回复6
  • 已保存回复8
  • 发布时间2024/8/10 21:41
  • 上次更新2024/8/10 22:52:16
查看原帖
Why F WA*19?
743373
Vitamin_B楼主2024/8/10 21:41
# pragma GCC optimize("Ofast,no-stack-protector")

# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

# include <bits/stdc++.h>

# define I return

# define AK 0

# define IOI ;

using namespace std;

typedef long long ll;

typedef pair <int, int> pii;

int n, k, maxx[200005];

ll dp[200005][15];

pii a[200005];

bool cmp (const pii& a, const pii& b) {

	return a.first * b.second + a.second < b.first * a.second + b.second;

}

int main () {

	ios::sync_with_stdio (0);

	cin.tie (0);

	cout.tie (0);

	cin >> n >> k;

	maxx[0] = 1;

	for (int i = 1; i <= n; ++ i)
		cin >> a[i].first >> a[i].second;

	sort (a + 1, a + 1 + n, cmp);

	for (int i = 1; i <= n; ++ i)
		for (int j = k; j; -- j)
			maxx[j] = max (maxx[j], a[i].first * maxx[j - 1] + a[i].second);

	cout << maxx[k];

	I AK IOI

}
2024/8/10 21:41
加载中...