Cod sursa(job #433001)
#include <iostream>
#include <fstream>
#include <stdlib.h>
using namespace std;
typedef struct gs{
unsigned int hg;
unsigned int gg;
//int ig;
} gs;
unsigned int n,h,u;
gs *gt;
unsigned int * luate;
unsigned int nr_luate = 0;
unsigned int p;
unsigned int gmax = 0;
unsigned int nivmax = 0;
unsigned int nivmin = 100000;
int compare (const void * a, const void * b)
{
return ( ((gs *)b)->gg - ((gs *)a)->gg);
}
int get_gmax(){
//cout<<"nivmax = "<<nivmax<<", nivmin = "<<nivmin<<", p = "<<p<<", n = "<<n<<endl;
unsigned int i,j;
unsigned int k;
for(i=0;i<p;i++){
if(i==n){
break;
}
k = 0;
for(j=0;j<nr_luate;j++){ /* cate s-au luat de "mai sus" */
if(luate[j] >= gt[i].hg){
k++;
}
}
//cout<<"nivmax = "<<nivmax<<", gt.hg = "<<gt[i].hg<<", gt.gg = "<<gt[i].gg<<", k = "<<k<<endl;
if(nivmax + 1 - gt[i].hg - k > 0 ){
luate[nr_luate++] = gt[i].hg;
gmax = gmax + gt[i].gg;
//cout<<"h = "<<gt[i].hg<<", g = "<<gt[i].gg<<endl;
}
else{
p++;
}
}
return 0;
}
int read_vec(){
ifstream fin;
unsigned int i;
fin.open("gutui.in",ios::in);
fin>>n;
fin>>h;
fin>>u;
gt = (gs *)malloc( n * sizeof( gs ));
nivmax = h/u + ((h%u == 0)?0:1);
//nivmax = h/u + 1; //???
for(i=0;i<n;i++){
fin>>gt[i].hg;
fin>>gt[i].gg;
gt[i].hg = (gt[i].hg / u) + ( (gt[i].hg % u == 0) ? 0 : 1 ) ;
//gt[i].hg = (gt[i].hg / u) + 1; //???
if(gt[i].hg < nivmin){
nivmin = gt[i].hg;
}
}
p = nivmax - nivmin + 1;
if(p > n){
p = n;
}
luate = (unsigned int *)malloc( p * sizeof( int ));
qsort (gt, n, sizeof(gs), compare);
fin.close();
return 0;
}
int write_sol(){
ofstream fout;
fout.open("gutui.out",ios::out);
fout<<gmax;
fout.close();
return 0;
}
int main(){
read_vec();
get_gmax();
write_sol();
//cout<<endl<<"gmax = "<< gmax;
//cin.get();//to_comment
return 0;
}