Cod sursa(job #2284186)

Utilizator rebeca98Tataru Rebeca rebeca98 Data 16 noiembrie 2018 22:17:57
Problema Lupul Urias si Rau Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.85 kb
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
struct oita{
int d, l;

}v[20];


int comparator(const void *p, const void *q)
{
    int l = ((struct oita *)p)->d;
    int r = ((struct oita *)q)->d;
if(l-r>0)
    return -1;
if(l-r<0)
    return 1;
if(l-r==0)
{
int l = ((struct oita *)p)->l;
    int r = ((struct oita *)q)->l;
    return (r-l)  ;
}


}



int main()
{
ifstream f("lupu.in");
ofstream g("lupu.out");
int n,m,dist;
f>>n>>m>>dist;
int i;
for(i=0;i<n;i++)
{
    f>>v[i].d>>v[i].l;


}
 qsort (v, n, sizeof(struct oita), comparator);


int s=0;
for(i=0;i<n;i++)
    {
	cout<<v[i].d<<" "<<v[i].l<<endl;
	if(v[i].d<m)
    {
     s=s+v[i].l;
     cout<<s<<" "<<endl;
     int j;
     for(j=i+1;j<n;j++)
        v[j].d=v[j].d+dist;

    }}

cout<<s;
    return 0;
}