UVa 11942 - Lumberjack Sequencing (check if input is sorted asc/ descending)

Link:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=229&page=show_problem&problem=3093
Sol:

#include <cstdio>
	using namespace std;
	int main() {
	int tc, c, p;
	bool up, down;
	scanf("%d", &tc);
	printf("Lumberjacks:\n");
	while (tc--) {
	up = down = false;
	scanf("%d", &p);
	for (int i = 0; i < 9; i++) {
	scanf("%d", &c);
	if (p < c)
	up = true;
	else
	down = true;
	p = c;
	}
	if (up && down)
	printf("Unordered\n");
	else
	printf("Ordered\n");
	}
	return 0;
	}