题解 [NOI Online 2022 提高组] 如何正确地排序

传送门

$\tt\huge十年\ OI\ 一场空，不开\ long\ long\ 见祖宗$

点击查看代码

#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define N 200010
#define ll long long
#define int128 __int128
//#define int long long

char buf[1<<21], *p1=buf, *p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf, 1, 1<<21, stdin)), p1==p2?EOF:*p1++)
inline int read() {
	int ans=0, f=1; char c=getchar();
	while (!isdigit(c)) {if (c=='-') f=-f; c=getchar();}
	while (isdigit(c)) {ans=(ans<<3)+(ans<<1)+(c^48); c=getchar();}
	return ans*f;
}
// char obuf[N]; int otop;
// inline void writeln(int128 t) {
// 	otop=0;
// 	do {obuf[++otop]='0'+t%10; t/=10;} while (t);
// 	while (otop) printf("%c", obuf[otop--]);
// 	printf("\n");
// }

int n, m;
int a[5][N];

namespace force{
	ll ans;
	ll f(int i, int j) {
		int mn=INF, mx=0;
		for (int k=1; k<=m; ++k) {
			mn=min(mn, a[k][i]+a[k][j]);
			mx=max(mx, a[k][i]+a[k][j]);
		}
		return mn+mx;
	}
	void solve() {
		for (int i=1; i<=n; ++i)
			for (int j=1; j<=n; ++j)
				ans+=f(i, j);
		cout<<ans<<endl;
	}
}

namespace task1{
	ll ans;
	void solve() {
		for (int k=1; k<=2; ++k) {
			ll sum=0;
			for (int i=1; i<=n; ++i) sum+=a[k][i];
			for (int i=1; i<=n; ++i) ans+=sum+1ll*n*a[k][i];
		}
		cout<<ans<<endl;
	}
}

signed main()
{
	freopen("sort.in", "r", stdin);
	freopen("sort.out", "w", stdout);

	m=read(); n=read();
	for (int i=1; i<=m; ++i) for (int j=1; j<=n; ++j) a[i][j]=read();
	if (m==2) task1::solve();
	else force::solve();

	return 0;
}