1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 100005;

int t[5][MAXN];

int main()
{
	int n, k, sm, c, d;
	long long wa=0LL, wb=0LL;
	scanf("%d%d", &n, &k);
	for (int j=0; j<k; j++)
	{
		for (int i=0; i<n; i++)
			scanf("%d", &t[j][i]);
	}
	
	if (k==2)
	{
		for (int i=0; i<n; i++)
		{
			if ((t[0][i]+t[1][i])%2==0)
			{
				sm=abs(t[0][i]-t[1][i])/2;
				wa+=sm;
				wb+=sm;
				printf("%d ", (t[0][i]+t[1][i])/2);
			}
			else
			{
				sm=abs(t[0][i]-t[1][i]);
				c=sm/2;
				d=sm-c;
				if (c>d) swap(c, d);
				//c<d
				if (wa<wb)
				{
					if (t[0][i]<t[1][i])
					{
						printf("%d ", (t[0][i]+t[1][i]+1)/2);
					}
					else
					{
						printf("%d ", (t[0][i]+t[1][i]-1)/2);
					}
					wb+=c;
					wa+=d;
				}
				else
				{
					if (t[0][i]<t[1][i])
					{
						printf("%d ", (t[0][i]+t[1][i]-1)/2);
					}
					else
					{
						printf("%d ", (t[0][i]+t[1][i]+1)/2);
					}
					wa+=c;
					wb+=d;
				}
			}
		}
		
		printf("\n");
		
		return 0;
	}
	
	return 0;
	//ADG
}