19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T759,#include #include #include using namespace std; vector > vec(501, vector(501, 0)); int main() { int n, m, b; cin >> n >> m >> b; unordered_map map; pair maxelem(0, 0), maxheight(0, 0), temp(2147483647, -1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> vec[i][j]; if (map.find(vec[i][j]) == map.end()) { map[vec[i][j]] = 1; if (vec[i][j] > maxheight.first) { maxheight = make_pair(vec[i][j], 1); } if (vec[i][j] >= maxelem.first && maxelem.second <= 1) maxelem = make_pair(vec[i][j], 1); } else { map[vec[i][j]] += 1; if (map[vec[i][j]] >= maxelem.second) { maxelem = make_pair(vec[i][j], map[vec[i][j]]); if (maxelem.first == maxheight.first) maxheight = maxelem; } } }

제출 #28291

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: