Pagini recente » Cod sursa (job #2294891) | Cod sursa (job #2096497) | Cod sursa (job #3350339) | Borderou de evaluare (job #1134361) | Cod sursa (job #3330995)
#include <fstream>
using namespace std;
struct intererupator {
int camera, tp, nrc, poz;
int v[1001];
};
intererupator a[10001];
void sortare (intererupator a[], int m)
{
int sortat = 0;
do {
sortat = 1;
for (int i = 0; i < (m - 1); i++)
if ((a[i].tp > a[i + 1].tp) || ((a[i].tp == a[i + 1].tp) && (a[i].nrc > a[i + 1].nrc)))
{
intererupator aux = a[i];
a[i] = a[i + 1];
a[i + 1] = aux;
sortat = 0;
}
} while (sortat == 0);
}
int main()
{
ifstream cin ("aprindere.in");
ofstream cout ("aprindere.out");
int n, m, cam[10001], s = 0;
cin >> n;
cin >> m;
for (int i = 0; i < n; i++)
cin >> cam[i];
for (int i = 0; i < m; i++)
{
cin >> a[i].camera >> a[i].tp >> a[i].nrc;
a[i].poz = i;
for (int j = 0; j < a[i].nrc; j++)
cin >> a[i].v[j];
}
sortare (a, m);
for (int i = 0; i < n; i++)
{
if (cam[i] == 0) {
for (int j = 0; j < m; j++)
if (a[j].poz == i) s += a[j].tp;
}
}
cout << s;
return 0;
}