Pagini recente » Cod sursa (job #2157096) | Cod sursa (job #1011354) | Cod sursa (job #2094055) | Cod sursa (job #999135) | Cod sursa (job #125602)
Cod sursa(job #125602)
#include <fstream>
std::ifstream f1("gardieni.in");
std::ofstream f2("gardieni.out");
int main()
{
unsigned int cost[1000000], n;
unsigned long long s=0, u, t, a, b, j, i, c;
f1>>n>>t;
for (i=0; i<n; i++)
{
f1>>a>>b>>c;
for (j=a; j<=b; j++)
if ((cost[j]==0)||(cost[j]>c))
cost[j]=c;
}//for i
for (i=1; i<=t; i++)
{
//f2<<cost[i]<<" ";
u=cost[i];
s+=u;
}//for i
f2<<s;
f1.close();
f2.close();
return 0;
}//main