| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 86259 | 2018-11-25T16:05:35 Z | MatesV13 | Pohlepko (COCI16_pohlepko) | C++11 | 0 ms | 0 KB |
#include <bits/stdc++.h>
using namespace std;
long long n, m;
string word, path, iznos[2000][2000];
char unos[2000][2000];
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i=0;i<n;i++){
cin >> word;
for(int j=0;j<m;j++){
unos[i][j] = word[j];
}
}
path = unos[0][0];
int i=0, j=0;
while (i!=n-1 and j!=m-1){
if (unos[i][j+1] > unos[i+1][j]){
i++;
path = path + unos[i][j];
}
else if (unos[i][j+1] > unos[i+1][j]){
j++;
path = path + unos[i][j];
}
else
}
while (i!=n-1){
i++;
path = path + unos[i][j];
}
while (j!=m-1){
j++;
path = path + unos[i][j];
}
cout << path;
return 0;
}