Pagini recente » Cod sursa (job #2929422) | Cod sursa (job #2304800) | Cod sursa (job #1914703) | Cod sursa (job #679713) | Cod sursa (job #1739201)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("fabrica.in");
ofstream fout("fabrica.out");
#define MAX 50000
#define NMAX 100000
multiset< pair<int, int> > s;
int c1[NMAX + 1],c2[NMAX + 1], nra[MAX + 1], nrb[MAX + 1], n, n1, n2, rez;
int main()
{
fin >> n >> n1 >> n2;
for(int i = 1; i <= n1; i++) fin >> nra[i];
for(int i = 1; i <= n2; i++) fin >> nrb[i];
//a
for(int i = 1; i <= n1; i++) s.insert(make_pair(nra[i],nra[i]));
for(int i = 1; i <= n; i++)
{
c1[i] = (*s.begin()).first;
s.insert(make_pair((*s.begin()).first +(*s.begin()).second,(*s.begin()).second));
s.erase(s.begin());
}
s.clear();
//b
for(int i = 1; i <= n2; i++) s.insert(make_pair(nrb[i],nrb[i]));
for(int i = 1; i <= n; i++)
{
c2[i] = (*s.begin()).first;
s.insert(make_pair((*s.begin()).first +(*s.begin()).second,(*s.begin()).second));
s.erase(s.begin());
}
s.clear();
/* for (int i = 1; i <= n; i++)
fout << c1[i] << ' ' << c2[i] << '\n';*/
for(int i = 1; i <= n; i++) rez = max(rez, c1[i] + c2[n - i + 1]);
fout << c1[n] << ' ' << rez;
return 0;
}