Cod sursa(job #2700001)
Utilizator | Alex Beginner style996 | Data | 26 ianuarie 2021 12:41:11 |
---|---|---|---|
Problema | Gardieni | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#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");
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;
in.close();
of.close();
}