Pagini recente » Cod sursa (job #2408984) | Cod sursa (job #2360282) | Cod sursa (job #1804127) | Cod sursa (job #1812453) | Cod sursa (job #2699969)
#include<iostream>
#include<string>
#include<stdlib.h>
#include<fstream>
#include <time.h>
#include <algorithm>
using namespace std;
int main()
{
ifstream in("gardieni.in");
ofstream of("gardieni.out");
int n,t,i,min,a[100][100],suma=0;
in>>n>>t;
for(i=1;i<=n;i++)
{ in>>a[i][1]>>a[i][2]>>a[i][3];
}
int count=1;
while(count<=t)
{
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];
//cout<<min<<'/';
}
// cout<<endl;
suma=suma+min;
// cout<<count<<'-'<<suma<<endl;
count++;
}
of<<suma;
// cout<<suma;
in.close();
of.close();
}