Over a million developers have joined DZone.

A Solution For The "Shoemaker" Problem

DZone's Guide to

A Solution For The "Shoemaker" Problem

· Java Zone
Free Resource

Try Okta to add social login, MFA, and OpenID Connect support to your Java app in minutes. Create a free developer account today and never build auth again.

A solution for the "Shoemaker" problem.

Problem description:

Author: Joana Matos Fonseca da Trindade
Date: 2008.04.06

 * Solution for "Shoemaker" problem.
 * UVa ID: 10026

#define NJOBS 1000

using namespace std;

int jobs[NJOBS]; /* jobs */
double p[NJOBS]; /* priority */

/* main */
int main() {
    int nc;/* number of cases */
int nj; /* number of jobs */
int ct;/* completion time */
int dp; /* daily penalty */

    cin >> nc;

/* for each test case.. */
    for (int i=0; i> nj;

/* init input */
for (int i=0; i> ct >> dp;
jobs[i] = i;
/* priority is daily penalty divided by completion time (minimal fine) */
p[i] = double(dp) / ct;

int j, k, tmp;

/* sort jobs by priority */
for (int i=0; i p[jobs[k]]) || ((p[jobs[j]] == p[jobs[k]]) && (jobs[j] 

Build and launch faster with Okta’s user management API. Register today for the free forever developer edition!


Opinions expressed by DZone contributors are their own.

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}