<p>Given a string <code>s</code> and a string array <code>dictionary</code>, return <em>the longest string in the dictionary that can be formed by deleting some of the given string characters</em>. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abpcplea&quot;, dictionary = [&quot;ale&quot;,&quot;apple&quot;,&quot;monkey&quot;,&quot;plea&quot;]
<strong>Output:</strong> &quot;apple&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abpcplea&quot;, dictionary = [&quot;a&quot;,&quot;b&quot;,&quot;c&quot;]
<strong>Output:</strong> &quot;a&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>1 &lt;= dictionary.length &lt;= 1000</code></li>
	<li><code>1 &lt;= dictionary[i].length &lt;= 1000</code></li>
	<li><code>s</code> and <code>dictionary[i]</code> consist of lowercase English letters.</li>
</ul>

#define pb push_back
class Solution {
public:
    bool checksub(string a1,string a2){
        int m=a1.size(),n=a2.size();
        int j=0;
        for(int i=0;i<n;i++){
            if(a2[i]==a1[j]){
                j++;
                if(j==m) return true;
            }
        }
        return false;
    }
    string findLongestWord(string s, vector<string>& d) {
        vector<pair<int,string>> v;
        for(int i=0;i<d.size();i++){
            v.pb({-d[i].size(),d[i]});
        }
        sort(v.begin(),v.end());
        string ans="";
        for(int i=0;i<v.size();i++){
            if(checksub(v[i].second,s)) return v[i].second;
        }
        return ans;
    }
};
29481