Category
Similar Problems

0111. Massiv11

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massiv M dan katta elementlari yig`indisi xisoblansin

Kiruvchi ma`lumotlar: Birinchi satrda N ($1\le N \le 100$). Ikkinchi satrda N ta butun son ($0\le a[i] \le 100$). Uchinchi satrda M ($1\le M \le 100$);

Chiquvchi ma`lumotlar: Masala yechimi

Input
4
12 88 30 87
94
Output
0
Input
9
9 72 18 48 75 32 29 78 25
76
Output
78