diff --git a/1162B - Double Matrix.cpp b/1162B - Double Matrix.cpp
new file mode 100644
index 0000000..4cee4da
--- /dev/null
+++ b/1162B - Double Matrix.cpp	
@@ -0,0 +1,78 @@
+// 61281468	Sep/25/2019 14:04UTC-3	joaodantas31.jpd	1162B - Double Matrix	GNU C++14	Accepted	31 ms	0 KB
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int a, b, n, aux;
+
+bool test;
+
+int main(){
+    cin >> a >> b;
+    int m1[a][b];
+    int m2[a][b];
+
+    for(int i = 0; i < a; i++){
+        for(int j = 0;j < b; j++){
+            cin >> n;
+            m1[i][j] = n;
+        }
+    }
+    for(int i = 0; i < a; i++){
+        for(int j = 0;j < b; j++){
+            cin >> n;
+            m2[i][j] = n;
+        }
+    }
+
+    for(int i = 0; i < a; i++){
+        for(int j = 0;j < b; j++){
+            if(m1[i][j] > m2[i][j]){
+                aux = m2[i][j];
+                m2[i][j] = m1[i][j];
+                m1[i][j] = aux;
+            }
+        }
+    }
+
+    test = true;
+
+    for(int i = 0; i < a; i++){
+        for(int j = 1;j < b; j++){
+            if(m1[i][j] <= m1[i][j-1]){
+                test = false;
+            }
+        }
+    }
+    for(int i = 0; i < a; i++){
+        for(int j = 1;j < b; j++){
+            if(m2[i][j] <= m2[i][j-1]){
+                test = false;
+            }
+        }
+    }
+
+    for(int i = 0; i < b; i++){
+        for(int j = 1;j < a; j++){
+            if(m1[j][i] <= m1[j-1][i]){
+                test = false;
+            }
+        }
+    }
+
+    for(int i = 0; i < b; i++){
+        for(int j = 1;j < a; j++){
+            if(m2[j][i] <= m2[j-1][i]){
+                test = false;
+            }
+        }
+    }
+
+    if(test){
+        cout <<"Possible"<< endl;
+    } else {
+        cout <<"Impossible"<< endl;
+    }
+
+}
diff --git a/549G - Happy Line.cpp b/549G - Happy Line.cpp
new file mode 100644
index 0000000..900cb1f
--- /dev/null
+++ b/549G - Happy Line.cpp	
@@ -0,0 +1,40 @@
+// 61448536	Sep/28/2019 20:31UTC-3	joaodantas31.jpd	549G - Happy Line	GNU C++17	Accepted	124 ms	800 KB
+
+#include <bits/stdc++.h>
+#include <list>
+
+using namespace std;
+
+int t, aux, temp;
+
+int main() {
+    ios_base::sync_with_stdio(false); cin.tie(0);
+
+    cin >> t;
+    int fila[t];
+
+    for(int i = 0; i < t; i ++){
+        cin >> aux;
+        aux = aux+i;
+        fila[i] = aux;
+    }
+
+    sort(fila, fila+t);
+
+    for (int i = 0; i < t; i ++)
+        fila[i] -= i;
+
+    for (int i = 1; i < t; i ++){
+        if(fila[i] < fila[i-1]){
+            cout << ":(" << endl;
+            return 0;
+        }
+    }
+
+    for (int i = 0; i < t; i ++)
+        cout << fila[i] << " ";
+    cout << endl;
+
+    return 0;
+
+}