시나브로

#include int tree[1000000]; int tree_amount = 0; int want_to_tree_amount = 0; int available(int mid) { long long buffer = 0; for (int i =tree_amount-1; i >0; i--) { if (tree[i] > mid) { buffer += tree[i] - mid; } if (tree[i] = want_to_tree_amount) return 1; return 0; } void quickSort(int first, int last) { int pivot; int i; int j; int temp; if (first < last) { pivot =..

#include #include #include using namespace std; int graph[1020][1020] = { 0 }; int main(void) { int test_case = 0; scanf("%d", &test_case); for (int i = 0; i < test_case; i++) { int person_number = 0; scanf("%d", &person_number); for (int n = 0; n < person_number; n++) { for (int m = 0; m < person_number; m++) { scanf("%d", &graph[n][m]); if (graph[n][m] == 0) graph[n][m] = 100000; if (n == m) g..