Designer PDF Viewer

                            Solution in C :

python 3  :


#!/bin/python3

import sys


h = [int(h_temp) for h_temp in input().strip().split(' ')]
word = input().strip()
max_height = 0
for i in range (len(word)):
    num = ord(word[i])-97
    if (h[num] >= max_height):
        max_height = h[num]

area = len(word)*max_height
print(area)











Java  :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = 26;
        int h[] = new int[n];
        for(int h_i=0; h_i < n; h_i++){
            h[h_i] = in.nextInt();
        }
        String word = in.next();
        
        int maxHeight = 0;
        for(char ch = 'a'; ch < 'z'; ch++) {
            if(word.contains(ch + "") && h[ch - 'a'] > maxHeight)
                maxHeight = h[ch - 'a'];
        }
        
        System.out.println(maxHeight * word.length());
    }
}










C ++  :

#include <bits/stdc++.h>

using namespace std;

int a[42];
char s[1231212];

int main() {
  for (int i = 0; i < 26; i++) {
    scanf("%d", a + i);
  }
  scanf("%s", s);
  int h = 0;
  int w = 0;
  for (int i = 0; s[i]; i++) {
    w++;
    h = max(h, a[s[i] - 'a']);
  }
  printf("%d\n", h * w);
  return 0;
}










C  :

#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int main(){
    int n=26;
    int *h = malloc(sizeof(int) * n);
    for(int h_i = 0; h_i < n; h_i++){
       scanf("%d",&h[h_i]);
    }
    char* word = (char *)malloc(512000 * sizeof(char));
    scanf("%s",word);
    int l=strlen(word);
    int i;
    int max=0;
    for(i=0;i<l;i++)
        {
        if(h[(int)word[i]-'a']>max)
            max=h[(int)word[i]-'a'];
    }
    printf("%d",max*l);
    return 0;
}