Submission #2681035

---

Source Code Expand

/*
ID: arthurc4
TASK: test
LANG: C++11
*/

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;

typedef vector<string> vs;
typedef vector<vs> vvs;

typedef vector<bool> vb;
typedef vector<vb> vvb;

typedef map<string,int> msi;
typedef map<int,int> mii;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll; // note 'single' ls

typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)

#define REPb(j, d, c) \
for (int j = int(d); j >= int(c); f--)

#define pb \
push_back

#define ff \
first

#define ss \
second

// LL OR INT ???
// DELETED IFSTREAM ???
int main()
{
	//ifstream cin("input.txt");
	//ifstream cin("test.in");
	//ofstream cout("test.out");

	int n, m;
	cin >> n >> m;

	vvll xyz;

	REP(i, 1, n)
	{
		ll x, y, z;
		cin >> x >> y >> z;

		xyz.pb({x, y, z});
	}

	ll max_score = - pow(10, 13);

	for(int i=-1; i<=1; i+=2)
	{
		for(int j=-1; j<=1; j+=2)
		{
			for(int k=-1; k<=1; k+=2)
			{
				vll new_xyz;

				REP(a, 0, n-1)
				{
					new_xyz.pb(ll(i)*xyz[a][0] + ll(j)*xyz[a][1] + ll(k)*xyz[a][2]);
				}

				sort(new_xyz.rbegin(), new_xyz.rend());

				ll score = 0;

				REP(b, 0, m-1)
				{
					score += new_xyz[b];
				}

				max_score = max(max_score, score);
			}
		}
	}

	cout << max_score << endl;

	return 0;
}

Submission Info

Judge Result