解説と同じ解法のsolutionを追加

Author: ryoissy

tsunahiki/c-correct-analysis/SOLUTION

@@ -0,0 +1,20 @@
+# -*- coding: utf-8; mode: python -*-
+
+## Solution
+c_solution(src='tsunahiki-ryoissy-greedy2.c') # -lm -O2 as default
+#cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=[])
+#java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
+#              challenge_cases=['10_corner*.in'])
+#script_solution(src='main.sh') # shebang line is required
+#script_solution(src='main.pl') # shebang line is required
+#script_solution(src='main.py') # shebang line is required
+#script_solution(src='main.rb') # shebang line is required
+#js_solution(src='main.js') # javascript (nodejs)
+#hs_solution(src='main.hs') # haskell (stack + ghc)
+#cs_solution(src='main.cs') # C# (mono)
+
+## Score
+#expected_score(100)

tsunahiki/c-correct-analysis/tsunahiki-ryoissy-greedy2.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+
+int N;
+int A[101];
+int B[101];
+
+void read_input(){
+	scanf("%d",&N);
+	for(int i=0;i<N;i++){
+		scanf("%d",&A[i]);
+	}
+	for(int i=0;i<N;i++){
+		scanf("%d",&B[i]);
+	}
+}
+
+void solve_greedy(){
+	int ans=0;
+	int rb=N;
+	for(int i=N-1;i>=0;i--){
+		while(rb>0){
+			rb--;
+			if(A[i]>B[rb]){
+				ans++;
+				break;
+			}
+		}
+	}
+	printf("%d\n",ans);
+}
+
+int main(void){
+	int T;
+	scanf("%d",&T);
+	for(int i=0;i<T;i++){
+		read_input();
+		solve_greedy();
+	}
+	return 0;
+}