Cod sursa(job #2224894)
Utilizator | Data | 25 iulie 2018 14:29:59 | |
---|---|---|---|
Problema | Pedefe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fi("pedefe.in");
ofstream fo("pedefe.out");
vector<int> s[3];
int n, m, k;
int main() {
fi >> n >> m >> k;
s[0].resize(n), s[1].resize(m), s[2].resize(k);
for (int i = 0; i < 3; ++i)
for (int &j: s[i])
fi >> j;
for (int i = 1; i < k; ++i)
assert(s[2][i - 1] < s[2][i]);
return 0; }