Submission #7946708
Source Code Expand
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
int main() {
int m, n;
cin >> m >> n;
int ans = 0;
REP(i, m) {
int cnt = 0;
REP(j, n) {
int a;
cin >> a;
cnt += a;
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
}