# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
39357 |
2018-01-12T12:06:41 Z |
14kg |
라멘 (JOI14_ramen) |
C++11 |
|
0 ms |
1120 KB |
#include "ramen.h"
#include <algorithm>
using namespace std;
bool cmp(int x, int y) {
return Compare(x, y) > 0;
}
void Ramen(int n) {
int d[300];
for (int i = 0; i < n; i++) d[i] = i;
sort(d, d + n, cmp);
Answer(d[n - 1], d[0]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1120 KB |
Output is correct |
2 |
Correct |
0 ms |
1120 KB |
Output is correct |
3 |
Correct |
0 ms |
1120 KB |
Output is correct |
4 |
Correct |
0 ms |
1120 KB |
Output is correct |
5 |
Correct |
0 ms |
1120 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1120 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1120 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |