$O(t)$
#include<cstdio> #include<algorithm> int a[10], t, n; int main() { scanf("%d", &t); while (t--) { for (int i = 0; i < 10; i++) scanf("%d", a + i); std::sort(a, a + 10); printf("%d\n", a[7]); } return 0; }
#include<cstdio> #include<algorithm> int a[10], t, n; int main() { scanf("%d", &t); while (t--) { for (int i = 0; i < 10; i++) scanf("%d", a + i); std::sort(a, a + 10); printf("%d\n", a[7]); } return 0; }
댓글 없음 :
댓글 쓰기