백준/백준-C++
2562번: 최대값
Beabletoet
2017. 9. 4. 18:30
1 2 3 4 5 6 7 8 9 10 | #include<cstdio> #include<algorithm> int main() { int num[9], *add; for (int i = 0; i < 9; ++i) scanf("%d", &num[i]); add = std::max_element(&num[0], &num[9]); printf("%d\n%d", *add, add - &num[0] + 1); } | cs |