5 3 1
2
2
2
2
2
3
4
6

ans: 11

5 3 3
1
2
3
4
5
1
4
7

ans: 12

9 9 123
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

ans: 9

> They fall until the total weight of the fallen stones exceeds k kilograms

So weight of fallen rocks should be at least k + 1

1 4 1
1
1 2 3 4
Ans 5

6 5 50
1 4 6 6 2 5
2 5 10 14 15
Ans 21

6 5 4
1 4 6 6 2 5
2 5 10 14 15
Ans 13

9 5 4
2 4 2 5 3 1 7 2 3
5 6 9 10 14
Ans 22

I've passed all of the user tests on here, and any test I can think of.
Still getting WA on #14.
Here's my non-working code.

import java.io.*;

public class P1998 {
    static StreamTokenizer in;
    static PrintWriter out;

    static int nextInt() throws IOException{
        do{
            in.nextToken();
        }while(in.ttype != StreamTokenizer.TT_NUMBER);
        return (int)in.nval;
    }

    public static void main(String[] args) throws IOException{
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);

        int n = nextInt();
        int m = nextInt();
        int k = nextInt();

        int[] stones = new int[n];
        int[] dropsTo = new int[n];

        int tmp = 0, j = 0;
        for(int i = 0; i < n; i++){
            stones[i] = nextInt();

            while(j < i - 1 && tmp - stones[j] > k){
                tmp -= stones[j];
                j++;
            }
            tmp += stones[i];
            dropsTo[i] = j;
        }

        j = 0;
        int moment, time = 0;
        for(int i = 0; i < m; i++){
            moment = nextInt() - time;

            time += moment;
            j += moment - 1;
            if(j >= n){
                time -= moment - n;
                j = n;
                break;
            }
            j = dropsTo[j];
        }

        out.println(time + n - j);
        out.flush();
    }
}

Please! Give me some tests.

try this test:
10 1 10
100
9
1
1
1
1
1
1
1
1
10
right answer:
19

As usual cannot find a mistake in my code. Program prints right answers on all user's tests in this discussion, however WA5 is still here.

UPD: oh, just should give test like '1 1 1 1 0'

Edited by author 16.03.2016 16:17

Add some tests...

why  wa  #5

Input:
3 2 1
2 2 2
2
3

Output:
6

Edited by author 14.02.2014 01:31

Edited by author 14.02.2014 01:31

If you have WA3 try this:
1 3 5
1
4
5
7
Right answer is 1

#include <stdio.h>
#include <vector>

#define pb push_back
#define For(i,n) for(int i=0;i<n;i++)

using namespace std;

int main()
{
    int n,m,k;
    vector < int > w;
    vector < int > v;
    scanf("%d%d%d",&n, &m, &k);
    For(i,n)
    {
        int x;
        scanf("%d", &x);
        w.pb(x);
    }
    For(i,m)
    {
        int x;
        scanf("%d", &x);
        x--;
        v.pb(x);
    }
    int ind=0;
    int tek=0;
    int ans=0;
    long long i=0;
    vector < int > solve;
    while (true)
    {
        if (ind<v.size() && i==v[ind])
        {
            int kol=0;
            while (kol<=k && solve.size()>0)
            {
                w.pb(solve[solve.size()-1]);
                solve.pop_back();
                kol+=w[w.size()-1];
            }
            ind++;
            i++;
            continue;
        }
        solve.pb(w[0]);
        w.erase(w.begin());
        i++;
        if (w.size()==0 || solve.size()==n)break;
    }
    printf("%d", i);
}

subj