Codeforces Round #291 (Div. 2) D - R2D2 and Droid Army

바로 가장 긴 단락입니다. 여러분의 가장 큰 합은 k를 넘지 않습니다...더블 포인터와 STL로 마음대로 쓰세요...

#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 200005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
//head

int a[maxn][5];
multiset<int> s[5];
multiset<int>::iterator it;
int n, m, K;
int res[10];

void read()
{
	scanf("%d%d%d", &n, &m, &K);
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			scanf("%d", &a[i][j]);
}

void work()
{
	int ans = 0;
	for(int i = 0, j = 0; i < n; i++) {
		int t = 0;
		for(int k = 0; k < m; k++) {
			s[k].insert(a[i][k]);
			t += *(--s[k].end());
		}
		while(j <= i && t > K) {
			for(int k = 0; k < m; k++) {
				it = s[k].find(a[j][k]);
				s[k].erase(it);
			}
			j++, t = 0;
			if(s[0].size() == 0) break;
			for(int k = 0; k < m; k++) t += *(--s[k].end());
		}
		if(ans < s[0].size()) {
			ans = s[0].size();
			for(int k = 0; k < m; k++) res[k] = *(--s[k].end());
		}
	}
	for(int k = 0; k < m; k++) printf("%d%c", res[k], k == m - 1 ? '
' : ' ');
}

int main()
{
	read();
	work();
	
	return 0;
}