Cod sursa(job #585987)
| Utilizator | Data | 30 aprilie 2011 13:04:08 | |
|---|---|---|---|
| Problema | Fabrica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.51 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("fabrica.in");
ofstream fout("fabrica.out");
int n, nra, nrb;
int a[50001], b[50001];
void read();
void solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
fin >> n;
fin >> nra >> nrb;
for(int i = 1; i <= nra; ++i)
fin >> a[i];
for(int i = 1; i <= nrb; ++i)
fin >> b[i];
fin.close();
}
void solve()
{
nth_element(a+1, a+1, a+nra+1);
fout << a[1] * n;
fout.close();
}
