Pagini recente » Borderou de evaluare (job #203464) | Borderou de evaluare (job #2023455) | Cod sursa (job #3231522) | Borderou de evaluare (job #2758113) | Cod sursa (job #2699999)
#include<iostream>
#include<string>
#include<stdlib.h>
#include<fstream>
#include <time.h>
#include <algorithm>
using namespace std;
int main()
{
ifstream in("gardieni.in.txt");
ofstream of("gardieni.out");
long int a[50010][4],t,count=0,n,i,min,suma=0;;
in>>n>>t;
for(i=1;i<=n;i++)
{ in>>a[i][1]>>a[i][2]>>a[i][3];
}
while(count<t)
{
count++;
min=10000;
for(i=1;i<=n;i++)
if(a[i][1]<=count && a[i][2]>=count && a[i][3]<min)
min=a[i][3];
suma=suma+min;
}
of<<suma;
cout<<suma;
in.close();
of.close();
}