In which standard and board you are ? And how you have cleared ZCO without knowledge of algorithms ? Any book you have referred ? Apologies for all such nasty questions . However I am prepa...

Thank you

This might help- International Olympiad in Informatics: Path to Gold

This problem can also be solved by using set<int> as set keep the data in sorted order!

Yes, you can implement your own priority queue using heap data structure.

#include<stdio.h>

Since C++ submissions are not running these days, is there any good efficient way to solve this using C?

This is the official explanation for the problem: Indian National Olympiad in Informatics Btw, this problem was part of the 2004 INOI

Yeah, your solution seems a lot more intuitive, thanks for sharing. :)

I submitted Malvika's solution with the following changes and documented the results, they are as follows:

1.Unchanged:

C++: 0.00 sec, C: 0.024 sec

Actually, putting this in intermediate because fluency with STL should be intermediate level.

This is a beginner question!

Probably I over thought it then , :D

Here's my solution if anyone needs help: [C++] NUMROUTE

Strange, I used C language and as I read in the comments that WA case, I did that workaround.

Still I was getting 60/100.

Then after a day I tried to increase the size of the...

    #define matrix vector<vector<int> >

    int N; cin >> N;

The testing data is available on the IARCS site, maybe you can get someone with access to add the problem on the contest page.

And also the other INOI 2017 problem.

Is there a judge where I can test my solution for this problem?