E. Two Arrays and Sum of Functions (math + greedy)

最新推荐文章于 2020-10-06 20:42:22 发布

Achanss

最新推荐文章于 2020-10-06 20:42:22 发布

阅读量186

点赞数 1

分类专栏：贪心

本文链接：https://blog.csdn.net/Achanss/article/details/90268528

版权

贪心专栏收录该内容

8 篇文章 0 订阅

订阅专栏

题目链接
统计求和公式中每个a[i]b[i]对答案的贡献，每个位置i会提供的(i+1)(n-1-i)次，题目要求只能移动b数组，故可用贪心思想：将a[i](i-1)(n-1-i) 较小的 * b[i]中较大的，相当于对每个固定不动的a[i]都找一个最佳的b[i]匹配，简单排序即可实现。

/*
* @Author: Achan
* @Date:   2019-05-15 21:34:08
* @Last Modified by:   Achan
* @Last Modified time: 2019-05-16 17:30:07
*/
#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<vector> 
#include<queue>
#include<cmath> 
using namespace std;

#define X 			first
#define Y 			second
#define eps  		1e-2
#define gcd 		__gcd
#define pb 			push_back
#define PI 			acos(-1.0)
#define lowbit(x) 	(x)&(-x)
#define fin         freopen("in.txt","r",stdin);
#define fout        freopen("out.txt","w",stdout);
#define Debug(format, ...) printf(format, ##__VA_ARGS__)
#define bug 		printf("!!!!!\n");
#define mem(x,y)	memset(x,y,sizeof(x))
#define rep(i,j,k)  for(int i=j;i<(int)k;i++)
#define per(i,j,k)  for(int i=j;i<=(int)k;i++)
#define pset(x)     setiosflags(ios::fixed)<<setprecision(x)
#define io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);

typedef long long ll;
typedef long double LD; 
typedef pair<int,int> pii;
typedef unsigned long long ull; 

const int inf  = 1<<30;
const ll  INF  = 1e18 ;
const int mod  = 998244353;
const int maxn = 1e5+2;
const int mov[4][2] = {-1,0,1,0,0,1,0,-1};
const int Mov[8][2] = {-1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1};
 
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

void read(int &x)
{
    x=0;int f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    x*=f;return;
}




int main(void)
{
	// fin 
	io
	int n;
	while(cin >> n)
	{
		std::vector<ll> a(n);
		std::vector<int> b(n);
		for (int i = 0; i < n; ++i)
		{
			cin >> a[i];
		}
		for (int i = 0; i < n; ++i)
		{
			cin >> b[i];
		}
		sort(b.begin(),b.end());
		for (int i = 0; i < n; ++i)
		{
			a[i] *= (ll)(i+1)*(n-i); //防爆int, long long > 1e18
		}
		sort(a.begin(),a.end());
		ll ans = 0;	
		for (ll i = 0; i < n; ++i)
		{
			ans += (a[i]%mod*b[n-1-i])%mod; //a[i]取模防爆long long
			ans %= mod;
		}
		cout << ans << endl;
	}

    
 #ifdef LOCAL
    Debug("My Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif   
}