SCPC diet solve

Author: Kangwoosun

SCPC/card_game/card_game.cpp

@@ -0,0 +1,50 @@
+/*
+You should use the standard input/output
+
+in order to receive a score properly.
+
+Do not use file input and output
+
+Please be very careful. 
+*/
+
+#include <iostream>
+
+using namespace std;
+
+int Answer;
+
+int main(int argc, char** argv)
+{
+	int T, test_case;
+	/*
+	   The freopen function below opens input.txt file in read only mode, and afterward,
+	   the program will read from input.txt file instead of standard(keyboard) input.
+	   To test your program, you may save input data in input.txt file,
+	   and use freopen function to read from the file when using cin function.
+	   You may remove the comment symbols(//) in the below statement and use it.
+	   Use #include<cstdio> or #include <stdio.h> to use the function in your program.
+	   But before submission, you must remove the freopen function or rewrite comment symbols(//).
+	 */	
+
+	// freopen("input.txt", "r", stdin);
+
+	cin >> T;
+	for(test_case = 0; test_case  < T; test_case++)
+	{
+
+		Answer = 0;
+		/////////////////////////////////////////////////////////////////////////////////////////////
+		/*
+		   Implement your algorithm here.
+		   The answer to the case will be stored in variable Answer.
+		 */
+		/////////////////////////////////////////////////////////////////////////////////////////////
+		
+		// Print the answer to standard output(screen).
+		cout << "Case #" << test_case+1 << endl;
+		cout << Answer << endl;
+	}
+
+	return 0;//Your program should return 0 on normal termination.
+}

SCPC/card_game/input

@@ -0,0 +1,72 @@
+/*
+You should use the standard input/output
+
+in order to receive a score properly.
+
+Do not use file input and output
+
+Please be very careful. 
+*/
+
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int A[200001];
+int B[200001];
+int Answer;
+
+int max(int a, int b){return (a>b?a:b);}
+
+int get_cal(int N, int K){
+    int result = 0;
+    sort(A, A+N);
+    sort(B, B+N);
+    
+    for(int i =0; i<K; ++i){
+        result = max(result, A[i] + B[K-i-1]);
+    }
+    
+    return result;
+}
+
+int main(int argc, char** argv)
+{
+	int T, test_case;
+	/*
+	   The freopen function below opens input.txt file in read only mode, and afterward,
+	   the program will read from input.txt file instead of standard(keyboard) input.
+	   To test your program, you may save input data in input.txt file,
+	   and use freopen function to read from the file when using cin function.
+	   You may remove the comment symbols(//) in the below statement and use it.
+	   Use #include<cstdio> or #include <stdio.h> to use the function in your program.
+	   But before submission, you must remove the freopen function or rewrite comment symbols(//).
+	 */	
+
+	// freopen("input.txt", "r", stdin);
+
+	cin >> T;
+	for(test_case = 0; test_case  < T; ++test_case)
+	{
+
+		Answer = 0;
+		
+		int N, K;
+		
+		cin >> N >> K;
+		
+		for(int i =0; i<N; ++i){
+		    cin >> A[i];
+		}
+		for(int i = 0; i<N; ++i){
+		    cin >> B[i];
+		}
+		Answer = get_cal(N, K);
+		
+		
+		cout << "Case #" << test_case+1 << endl;
+		cout << Answer << endl;
+	}
+
+	return 0;//Your program should return 0 on normal termination.
+}

SCPC/diet/diet.cpp

@@ -0,0 +1,7 @@
+2
+2 2
+1 2
+4 2
+3 2
+6 3 1
+1 4 3

SCPC/diet/input

@@ -0,0 +1,37 @@
+#include <iostream>
+using namespace std;
+
+
+char comp[10];
+bool check[10];
+int k;
+
+void max(){
+    
+    for(int i =0; i<k; ++i){
+        
+        if(comp[i] == '>'){
+            
+        }
+        
+        
+    }
+    
+}
+void min(){
+    
+}
+
+int main(){
+    
+    cin >> k;
+    
+    for(int i =0; i<k; ++i){
+        
+        cin >> comp[i];
+    }
+    
+    
+    
+    
+}

baekjoon/practice/brute_force/2529/2529_2.cpp

@@ -0,0 +1,8 @@
+
+
+
+
+
+//https://joonas.tistory.com/25
+//https://www.crocus.co.kr/1232
+//https://core-research-team.github.io/?fbclid=IwAR1YCD3yHKvkAkJncpW-JRPS52MlbtMWFeFJWlXqMzCi5LMZkbZvyC69m2k

baekjoon/practice/brute_force/6064/6064.cpp

@@ -0,0 +1,6 @@
+5
+10 12 3 9
+10 12 10 12
+13 11 5 6
+15 13 2 4
+40000 39999 40000 39999